Perfect matchings in claw-free cubic graphs

zbMath1217.05188arXiv0906.2261MaRDI QIDQ540046

Sang-il Oum

Publication date: 1 June 2011

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/0906.2261

zbMATH Keywords

cubic graphperfect matchingclaw free graph

Mathematics Subject Classification ID

Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (9)

Power domination in cubic graphs and Cartesian products ⋮ Ear decomposition and induced even cycles ⋮ A superlinear bound on the number of perfect matchings in cubic bridgeless graphs ⋮ A 2-bisection with small number of monochromatic edges of a claw-free cubic graph ⋮ 2-bisections in claw-free cubic multigraphs ⋮ A note on 2-bisections of claw-free cubic graphs ⋮ S_12 and P_12-colorings of cubic graphs ⋮ Normal 6-edge-colorings of some bridgeless cubic graphs ⋮ On Sylvester Colorings of Cubic Graphs

This page was built for publication: Perfect matchings in claw-free cubic graphs