000			a
999			_c33761 | 2191-8201 _d33761
008			250301b xxu||||| |||| 00| 0 eng d
020			_a9783319319506
082			_a510 _bGEO
100			_aGeorge, John C.
245			_aPancyclic and bipancyclic graphs
260			_bSpringer, _c2016 _aCham :
300			_axii, 108 p. ; _bill., _c24 cm
365			_b49.99 _c€ _d93.20
490			_aSpringerBriefs in Mathematics, _v2191-8201
504			_aIncludes bibliographical references.
520			_aThis 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?
650			_aNumerical analysis
650			_aGraph theory
650			_aComplete bipartite graph
650			_aContains cycles
650			_aCycle space
650			_aG contains
650			_aHamilton cycle
650			_ak-connected graph
650			_aMinimal bipancyclic graphs
650			_aUniquely bipancyclic graph
700			_aKhodkar, Abdollah
700			_aWallis, W. D.
942			_2ddc _cBK