حدس های زیبا در نظریه گراف

مراجع و منابع این مقاله:

• [1] M. Aigner and G. Ziegler, Proofs from the Book, ...
• [1] P. J. Kelly, On Isometric Transformations, Ph. D. thesis, ...
• [2] S. M. Ulam, A Collection of Mathematical Problems, Wiley ...
• [3] F. Harary, On the reconstruction of a graph from ...
• [4] C. Thomassen, Counterexamples to the Edge Reconstruction Conjecture for ...
• [5] R. P. Stanley, Reconstruction from vertex-switching, J. Combin. Theory ...
• [6] M. N. Ellingham, Recent progress in edge reconstruction, Congressus ...
• [7] J. A. Bondy, A graph reconstructor’s manual, in Surveys ...
• [8] L. Babai, Automorphism groups, isomorphism, reconstruction. Chapter 27 of ...
• [9] J. Lauri and R. Scapellato, Topics in Graph Automorphisms ...
• [1] L. Lovász, On covering of graphs, in Theory of ...
• [2] J. W. Moon, Topics on Tournaments, Holt, Rinehart and ...
• [3] A. Donald, An upper bound for the path number ...
• [4] T. Jiang, Hajós conjecture is true for planar graphs, ...
• [5] O. Favaron and M. Kouider, Path partitions and cycle ...
• [1] J. Edmonds, Maximum matching and a polyhedron with (0,1) ...
• [2] D. R. Fulkerson, Blocking and antiblocking pairs of polyhedra, ...
• [3] G. Szekeres, Polyhedral decompositions of cubic graphs, Bull. Austral. ...
• [4] P. D. Seymour, Sums of circuits, in Graph Theory ...
• [5] M. Preissmann, Sur les colorations des arêtes des graphes ...
• [6] J. C. Bermond, B. Jackson and F. Jaeger, Shortest ...
• [7] D. Archdeacon, Face colorings of embedded graphs, J. Graph ...
• [8] F. Jaeger, A survey of the cycle double cover ...
• [9] J. A. Bondy, Small cycle double covers of graphs, ...
• [10] H. Li, Perfect path double covers in every simple ...
• [11] G. Fan, Integer flows and cycle covers, J. Combin. ...
• [12] C. Q. Zhang, Integer Flows and Cycle Covers of ...
• [1] W. T. Tutte, A contribution to the theory of ...
• [2] P. D. Seymour, Nowhere-zero 6-flows, J. Combin. Theory Ser. ...
• [3] F. Jaeger, Nowhere-zero flow problems, in Selected Topics in ...
• [4] P. D. Seymour, Nowhere-zero flows, in Handbook of Combinatorics, ...
• [5] C. Q. Zhang, Integer Flows and Cycle Covers of ...
• [1] H. Hadwiger, Über eine Klassifikation der Streckenkomplexe, Vierteljschr. Naturforsch. ...
• [2] S. Hedetniemi, Homomorphisms of graphs and automata, Technical Report ...
• [3] R. L. Graham and H. O. Pollak, On the ...
• [4] K. Appel and W. Haken, A solution of the ...
• [5] H. Tverberg, On the decomposition of Kn into complete ...
• [6] M. El-Zahar and N. Sauer, The chromatic number of ...
• [7] N. Robertson, P. Seymour and R. Thomas, Hadwiger’s conjecture ...
• [8] T. R. Jensen and B. Toft, Graph Coloring Problems, ...
• [9] B. Toft, A survey of Hadwiger’s Conjecture, in Surveys ...
• [10] X. Zhu, A survey on Hedetniemi’s conjecture, Taiwanese J. ...
• [11] N. Sauer, Hedetniemi’s conjecture — a survey, Discrete Math., ...
• [12] A. Thomason, The extremal function for complete minors, J. ...
• [13] D. Romero and A. Sánchez-Arroyo, Advances on the Erdős–Faber–Lovász ...
• [1] B. Bollobás and A. J. Harris, List colourings of ...
• [2] F. Galvin, The list chromatic index of a bipartite ...
• [3] J. Kahn, Asymptotically good list-colorings, J. Combin. Theory Ser. ...
• [1] M. Behzad, Graphs and their Chromatic Numbers, Ph. D. ...
• [2] V. G. Vizing, Some unsolved problems in graph theory, ...
• [3] M. Molloy and B. Reed, A bound on the ...
• [1] A. Adám, Problem 2, in Theory of Graphs and ...
• [2] M. Behzad, G. Chartrand and C. E. Wall, On ...
• [3] L. Caccetta and R. Häggkvist, On minimal digraphs with ...
• [4] Ja. Grinberg, Examples of non-Adám multigraphs, Latvian Math. Yearbook, ...
• [5] Y. O. Hamidoune, A note on minimal directed graphs ...
• [6] C. T. Hoàng and B. Reed, A note on ...
• [7] C. Thomassen, Counterexamples to Adam’s conjecture on arc reversals ...
• [8] N. Dean and B. J. Latka, Squaring the tournament ...
• [9] D. C. Fisher, Squaring a tournament: a proof of ...
• [10] F. Havet and S. Thomassé, Median orders of tournaments: ...
• [11] J. Shen, On the Caccetta–Häggkvist Conjecture, Graphs Combin., 18 ...
• [12] G. Chen, J. Shen and R. Yuster, Second neighborhood ...
• [13] B. D. Sullivan, A summary of results and problems ...
• [1] B. Roy, Nombre chromatique et plus longs chemins d’un ...
• [2] T. Gallai, On directed paths and circuits, in Theory ...
• [3] T. Gallai and A. N. Milgram, Verallgemeinerung eines graphentheoretischen ...
• [4] G. Hahn and B. Jackson, A note concerning paths ...
• [5] F. Havet, Stable set meeting every longest path, Discrete ...
• [6] J. M. Laborde, C. Payan and N. H. Xuong, ...
• [1] L. Lovász, On graphs not containing independent circuits (Hungarian), ...
• [2] L. Babai, Long cycles in vertex transitive graphs, J. ...
• [3] M. Grِtschel, On intersections of longest cycles, in Graph ...
• [4] M. Matthews and D. Sumner, Hamiltonian results in K1; ...
• [5] C. Thomassen, Reflections on graph theory, J. Graph Theory, ...
• [6] S. M. Zhan, On hamiltonian line graphs and connectivity, ...
• [7] Z. Ryjaček, On a closure concept in claw-free graphs, ...
• [8] C. Thomassen, Chords of longest cycles in cubic graphs, ...
• [9] E. Birmelé, Thèse de doctorat, Université Lyon 1, 2003. ...
• [10] E. Birmelé, J. A. Bondy and B. A. Reed, ...
• [1] W. T. Tutte, On hamiltonian circuits, J. London Math. ...
• [2] W. T. Tutte, A theorem on planar graphs, Trans. ...
• [3] J. Sheehan, The multiplicity of Hamiltonian circuits in a ...
• [4] A. G. Thomason, Hamiltonian cycles and uniquely edge colourable ...
• [5] M. Chrobak and S. Poljak, On common edges in ...
• [6] N. Alon, Non-constructive proofs in combinatorics, in Proc. Internat. ...
• [7] H. Fleischner, Uniqueness of maximal dominating cycles in 3 ...
• [8] C. Thomassen, On the number of hamiltonian cycles in ...
• [9] C. Thomassen, Chords of longest cycles in cubic graphs, ...
• [10] C. Thomassen, Independent dominating sets and a second Hamiltonian ...
• [11] H. Fleischner, Uniquely Hamiltonian graphs of minimum degree four, ...
• [12] P. Haxell, B. Seamone and J. Verstraëte, Independent dominating ...
نمایش کامل مراجع