Cyclically five-connected cubic graphs

Journal of Combinatorial Theory Series B ◽

10.1016/j.jctb.2017.03.003 ◽

2017 ◽

Vol 125 ◽

pp. 132-167 ◽

Author(s):

Neil Robertson ◽

P.D. Seymour ◽

Robin Thomas

Keyword(s):

Download Full-text

Reflexive coloring complexes for 3-edge-colorings of cubic graphs

Discrete Mathematics ◽

10.1016/j.disc.2021.112309 ◽

2021 ◽

Vol 344 (4) ◽

pp. 112309

Author(s):

Fiachra Knox ◽

Bojan Mohar ◽

Nathan Singer

Keyword(s):

Cubic Graphs ◽

Download Full-text

Cubic Graphs with Large Girth

Annals of the New York Academy of Sciences ◽

10.1111/j.1749-6632.1989.tb22437.x ◽

1989 ◽

Vol 555 (1 Combinatorial) ◽

pp. 56-62 ◽

Author(s):

N. L. BIGGS

Keyword(s):

Cubic Graphs ◽

Download Full-text

An upper bound on the domination number of n-vertex connected cubic graphs

Discrete Mathematics ◽

10.1016/j.disc.2007.12.009 ◽

2009 ◽

Vol 309 (5) ◽

pp. 1142-1162 ◽

Author(s):

A.V. Kostochka ◽

B.Y. Stodolsky

Keyword(s):

Upper Bound ◽

Domination Number ◽

Download Full-text

Semisymmetric cubic graphs of twice odd order

European Journal of Combinatorics ◽

10.1016/j.ejc.2005.06.007 ◽

2007 ◽

Vol 28 (2) ◽

pp. 572-591 ◽

Author(s):

C.W. Parker

Keyword(s):

Cubic Graphs ◽

Download Full-text

Splitter Theorems for Cubic Graphs

Combinatorics Probability Computing ◽

10.1017/s0963548305007340 ◽

2006 ◽

Vol 15 (03) ◽

pp. 355 ◽

Author(s):

GUOLI DING ◽

JINKO KANNO

Keyword(s):

Download Full-text

Even cycles with prescribed chords in planar cubic graphs

Discrete Mathematics ◽

10.1016/0012-365x(83)90191-7 ◽

1983 ◽

Vol 44 (3) ◽

pp. 275-280 ◽

Author(s):

Herbert Fleischner

Keyword(s):

Download Full-text

Super–edge–graceful Labelings of Some Cubic Graphs

Acta Mathematica Sinica English Series ◽

10.1007/s10114-005-0672-8 ◽

2006 ◽

Vol 22 (6) ◽

pp. 1621-1628

Author(s):

Wai Chee Shiu

Keyword(s):

Download Full-text

Even polyhedral decompositions of cubic graphs

Discrete Mathematics ◽

10.1016/0012-365x(80)90270-8 ◽

1980 ◽

Vol 32 (3) ◽

pp. 331-334 ◽

Author(s):

M. Preissmann

Keyword(s):

Download Full-text

Domination versus total domination in claw-free cubic graphs

Discrete Mathematics ◽

10.1016/j.disc.2021.112784 ◽

2022 ◽

Vol 345 (4) ◽

pp. 112784

Author(s):

Ammar Babikir ◽

Michael A. Henning

Keyword(s):

Cubic Graphs ◽

Total Domination

Download Full-text

Lower Bounds For Induced Forests in Cubic Graphs

Canadian Mathematical Bulletin ◽

10.4153/cmb-1987-028-5 ◽

1987 ◽

Vol 30 (2) ◽

pp. 193-199 ◽

Author(s):

J. A. Bondy ◽

Glenn Hopkins ◽

William Staton

Keyword(s):

Lower Bound ◽

Lower Bounds ◽

Cubic Graphs ◽

AbstractIf G is a connected cubic graph with ρ vertices, ρ > 4, then G has a vertex-induced forest containing at least (5ρ - 2)/8 vertices. In case G is triangle-free, the lower bound is improved to (2ρ — l)/3. Examples are given to show that no such lower bound is possible for vertex-induced trees.

Download Full-text