Cubic Graphs with Large Girth

1989 ◽  
Vol 555 (1 Combinatorial) ◽  
pp. 56-62 ◽  
Author(s):  
N. L. BIGGS
Keyword(s):  
Cubic Graphs ◽  
Large Girth

Uniquely Colourable Graphs with Large Girth

1976 ◽  
Vol 28 (6) ◽  
pp. 1340-1344 ◽  
Author(s):  
Béla Bollobás ◽  
Norbert Sauer
Keyword(s):  
Chromatic Number ◽  
Large Girth ◽  
Large Chromatic Number

Tutte [1], writing under a pseudonym, was the first to prove that a graph with a large chromatic number need not contain a triangle. The result was rediscovered by Zykov [5] and Mycielski [4]. Erdös [2] proved the much stronger result that for every k ≧ 2 and g there exist a k-chromatic graph whose girth is at least g.

scholarly journals Light graphs in planar graphs of large girth

2016 ◽  
Vol 36 (1) ◽  
pp. 227
Author(s):  
Peter Hudák ◽  
Mária Maceková ◽  
Tomas Madaras ◽  
Pavol Široczki
Keyword(s):  
Planar Graphs ◽  
Large Girth

Relating ordinary and total domination in cubic graphs of large girth

2013 ◽  
pp. 53-57
Author(s):  
Simone Dantas ◽  
Felix Joos ◽  
Christian Löwenstein ◽  
Dieter Rautenbach ◽  
Deiwison S. Machado
Keyword(s):  
Cubic Graphs ◽  
Total Domination ◽  
Large Girth
Sign in / Sign up

Export Citation Format

Share Document