Search results

* [https://www.win.tue.nl/~aeb/graphs/Suzuki.html A. E. Brouwer's website: the Suzuki graph] [[Category:Individual graphs]] ...

| title = Distance-regular graphs * [http://www.win.tue.nl/~aeb/graphs/Sylvester.html A.E. Brouwer's website: the Sylvester graph] ...

| title = Distance-Regular Graphs * [http://www.win.tue.nl/~aeb/graphs/Wells.html A.E. Brouwer's website: The Armanios-Wells graph] ...

| title = Fast generation of regular graphs and construction of cages It is one of the four [[cage graph|(5,5)-cage graphs]], the others being the [[Foster cage]], the [[Robertson–Wegner graph]], an ...

| journal = Graphs and Combinatorics | title = Uniqueness and nonexistence of some graphs related to {{math|''M''₂₂}} ...

| title = Fast generation of regular graphs and construction of cages | year = 1999}}.</ref> It is one of the four [[cage graph|(5,5)-cage graphs]], the others being the [[Meringer graph]], the [[Robertson–Wegner graph]], ...

| title = Fast generation of regular graphs and construction of cages | year = 1999}}.</ref> It is one of the four [[cage graph|(5,5)-cage graphs]], the others being the [[Foster cage]], the [[Meringer graph]], and the [[ ...

== Bull-free graphs == ...or2-link=Najiba Sbihi|title=Recognizing bull-free perfect graphs|journal=[[Graphs and Combinatorics]]|volume=11|year=1995|pages=171–178|issue=2|doi=10.1007/B ...

...ef>[http://genealogy.math.ndsu.nodak.edu/id.php?id=35587 Allan Gewirtz], ''Graphs with Maximal Even Girth'', Ph.D. Dissertation in Mathematics, City Universi * {{cite web |url=http://www.win.tue.nl/~aeb/graphs/Sims-Gewirtz.html |title=Sims-Gewirtz graph |author=Brouwer, Andries}} ...

It is one of the four [[cage graph|(5,5)-cage graphs]], the others being the [[Foster cage]], the [[Meringer graph]], and the [[ [[Category:Individual graphs]] ...

...nger-Verlag, 1989.</ref> The Biggs&ndash;Smith graph is one of the 13 such graphs. ....<ref>[[Marston Conder|Conder, M.]] and Dobcsányi, P. "Trivalent Symmetric Graphs Up to 768 Vertices." J. Combin. Math. Combin. Comput. 40, 41&ndash;63, 2002 ...

[[Category:Individual graphs]] [[Category:Regular graphs]] ...

...onian path]]. This property was used by Tutte when combining three Walther graphs to produce the [[Tutte graph]],<ref>{{citation|doi=10.1112/jlms/s1-21.2.98| [[Category:Individual graphs]] ...

...es of a 3-regular graph;<ref>{{Citation | last1=Frucht | first1=R. | title=Graphs of degree three with a given abstract group | doi = 10.4153/CJM-1949-033-6 [[Category:Individual graphs]] ...

...}-valent {{mvar|n}}-connected nonHamiltonian non-{{mvar|n}}-edge-colorable graphs [[Category:Individual graphs]] ...

[[Category:Individual graphs]] [[Category:Regular graphs]] ...

...cop number]] 4.<ref name="ROB4">Turcotte, J., & Yvon, S. (2021). 4-cop-win graphs have at least 19 vertices. Discrete Applied Mathematics, 301, 74-98.</ref> [[Category:Individual graphs]] ...

...lfram.com/MoserSpindlesGolombGraphsAndRoot33/|title=Moser Spindles, Golomb Graphs and Root 33|work=Wolfram Demonstrations Project|date=December 21, 2017|firs | title = All generalized Petersen graphs are unit-distance graphs ...

...ltonian graph|Hamiltonian]].<ref>Tutte, W. T. "On the 2-Factors of Bicubic Graphs." Discrete Math. 1, 203-208, 1971/72.</ref><ref>Bondy, J. A. and Murty, U. ...." Discrete Math. 41, 35-41, 1982.</ref><ref>Owens, P. J. "Bipartite Cubic Graphs and a Shortness Exponent." Discrete Math. 44, 327-330, 1983.</ref> ...

...endently in 1976<ref>{{citation|first=P. G.|last=Doyle|title=On Transitive Graphs|series=Senior Thesis|publisher=Harvard College|year=1976}}. As cited by Mat [[Category:Individual graphs]] ...