Closure operation for even factors on claw-free graphs

DOI10.1016/J.DISC.2011.04.009zbMath1235.05116OpenAlexW2054085377MaRDI QIDQ2275395

Limning Xiong

Publication date: 8 August 2011

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2011.04.009

zbMATH Keywords

claw-free graphclosureeven factorsupereulerian

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (6)

Even factors with a bounded number of components in iterated line graphs ⋮ Induced hourglass and the equivalence between Hamiltonicity and supereulerianity in claw-free graphs ⋮ Forbidden pairs of disconnected graphs for supereulerianity of connected graphs ⋮ Pairs of forbidden subgraphs and 2-connected supereulerian graphs ⋮ Induced claws and existence of even factors of graphs ⋮ A neighborhood union condition for fractional \((a, b, k)\)-critical covered graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Closure concept for 2-factors in claw-free graphs
• Closure, stability and iterated line graphs with a 2-factor
• A method in graph theory
• On a closure concept in claw-free graphs
• On graph closures
• Closure concepts: A survey
• Closure and stable Hamiltonian properties in claw-free graphs
• Contractibility techniques as a closure concept

This page was built for publication: Closure operation for even factors on claw-free graphs