Graph Theory

This book is based on Graph Theory courses taught by P.A. Petrosyan, V.V. Mkrtchyan and R.R. Kamalian at Yerevan State University.

[1]  Riste Skrekovski,et al.  The Petersen graph is not 3-edge-colorable--a new proof , 2003, Discret. Math..

[2]  Limin Zhang,et al.  Every Planar Graph with Maximum Degree 7 Is of Class 1 , 2000, Graphs Comb..

[3]  H. Fleischner.  Eulerian graphs and related topics , 1990 .

[4]  L. Lovász.  A note on the line reconstruction problem , 1972 .

[5]  Carsten Thomassen,et al.  The Graph Genus Problem is NP-Complete , 1989, J. Algorithms.

[6]  K. Wagner.  Über eine Eigenschaft der ebenen Komplexe , 1937 .

[7]  Paul A. Catlin,et al.  Hajós' graph-coloring conjecture: Variations and counterexamples , 1979, J. Comb. Theory, Ser. B.

[8]  David S. Johnson,et al.  Crossing Number is NP-Complete , 1983 .

[9]  G. Dirac.  A Property of 4-Chromatic Graphs and some Remarks on Critical Graphs , 1952 .

[10]  Claude Berge,et al.  Graphs and Hypergraphs , 2021, Clustering.

[11]  Yue Zhao,et al.  On total 9-coloring planar graphs of maximum degree seven , 1999, J. Graph Theory.

[12]  L. Lovász.  Three short proofs in graph theory , 1975 .

[13]  D. West.  Introduction to Graph Theory , 1995 .

[14]  Vladimír Müller,et al.  The edge reconstruction hypothesis is true for graphs with more than n · log2n edges , 1977, J. Comb. Theory, Ser. B.

[15]  Robin Thomas,et al.  Hadwiger's conjecture forK6-free graphs , 1993, Comb..

[16]  H. Yap.  Total Colourings of Graphs , 1996 .

[17]  Robin Thomas,et al.  The Four-Colour Theorem , 1997, J. Comb. Theory, Ser. B.

[18]  R. Bruce Richter,et al.  The crossing number of c4 × c4 , 1995, J. Graph Theory.

[19]  Gary Chartrand,et al.  The Colour Numbers of Complete Graphs , 1967 .

[20]  Zhongfu Zhang,et al.  A short proof of Nash-Williams' theorem for the arboricity of a graph , 1994, Graphs Comb..

[21]  B. Bollobás,et al.  Extremal Graph Theory , 2013 .