Skip to main content

Pancyclic and Bipancyclic Graphs

  • Book
  • © 2016

Overview

  • Provides an up-to-date survey on pancyclic and bipartite graphs
  • Surveys fundamental ideas of graph theory
  • Creates a clear overview of the field via unified terminology
  • Includes supplementary material: sn.pub/extras

Part of the book series: SpringerBriefs in Mathematics (BRIEFSMATH)

This is a preview of subscription content, log in via an institution to check access.

Access this book

eBook USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access

Licence this eBook for your library

Institutional subscriptions

Table of contents (8 chapters)

Keywords

About this book

This book is focused on pancyclic and bipancyclic graphs and is geared toward researchers and graduate students in graph theory. Readers should be familiar with the basic concepts of graph theory, the definitions of a graph and of a cycle. Pancyclic graphs contain cycles of all possible lengths from three up to the number of vertices in the graph. Bipartite graphs contain only cycles of even lengths, a bipancyclic graph is defined to be a bipartite graph with cycles of every even size from 4 vertices up to the number of vertices in the graph. Cutting edge research and fundamental results on pancyclic and bipartite graphs from a wide range of journal articles and conference proceedings are composed in this book to create a standalone presentation.

The following questions are highlighted through the book:

- What is the smallest possible number of edges in a pancyclic graph with v vertices?

- When do pancyclic graphs exist with exactly one cycle of every possible length?

- What is the smallest possible number of edges in a bipartite graph with v vertices?

- When do bipartite graphs exist with exactly one cycle of every possible length?

Reviews

“In this book, the authors give a simple survey about the sufficient conditions for a graph to be pancyclic (uniquely bipancyclic). Moreover, the authors give the proofs of some classic results which are useful tools to study and generalize cycle problems. Therefore, this book can help students and researchers alike to find inspiration and ideas on pancyclic and bipancyclic problems.” (Junqing Cai, Mathematical Reviews, February, 2017)

Authors and Affiliations

  • BARNESVILLE, USA

    John C. George

  • Department of Mathematics, University of West Georgia, Carrollton, USA

    Abdollah Khodkar

  • Department of Mathematics, Southern Illinois University, Evansville, USA

    W.D. Wallis

Bibliographic Information

Publish with us