The structure of even factors in claw-free graphs

DOI10.1016/j.disc.2008.05.020zbMath1214.05139OpenAlexW1972969184MaRDI QIDQ1025500

Longsheng Han, Mei Lu, Limning Xiong

Publication date: 19 June 2009

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

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

zbMATH Keywords

claw-free grapheven factorcomponents of an even factor

Mathematics Subject Classification ID

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

Related Items (3)

Induced claws and existence of even factors of graphs ⋮ Spanning subgraph with Eulerian components ⋮ Catlin’s reduced graphs with small orders

Cites Work

• Unnamed Item
• Recharacterizing Eulerian: Intimations of new duality
• Spanning eulerian subgraphs, the splitting lemma, and Petersen's theorem
• Connected factors in graphs -- a survey
• Even subgraphs of bridgeless graphs and 2-factors of line graphs
• The upper bound of the number of cycles in a 2-factor of a line graph
• Spanning even subgraphs of 3‐edge‐connected graphs
• Longest paths and cycles in K1,3-free graphs

This page was built for publication: The structure of even factors in claw-free graphs