Even subgraphs of bridgeless graphs and 2-factors of line graphs
From MaRDI portal
Publication:2461204
DOI10.1016/j.disc.2006.11.023zbMath1127.05080OpenAlexW2038078172MaRDI QIDQ2461204
Kiyoshi Yoshimoto, Bill Jackson
Publication date: 27 November 2007
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2006.11.023
Related Items (12)
Sharp upper bounds on the minimum number of components of 2-factors in claw-free graphs ⋮ On Dominating Even Subgraphs in Cubic Graphs ⋮ Edge-connectivity and edges of even factors of graphs ⋮ 2-factors and independent sets on claw-free graphs ⋮ 2-factors in claw-free graphs with lower bounds cycle lengths ⋮ On the number of components in 2-factors of claw-free graphs ⋮ Computing Sharp 2-Factors in Claw-Free Graphs ⋮ Computing sharp 2-factors in claw-free graphs ⋮ 2-factors with bounded number of components in claw-free graphs ⋮ The structure of even factors in claw-free graphs ⋮ Spanning subgraph with Eulerian components ⋮ Spanning even subgraphs of 3‐edge‐connected graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Regular factors of line graphs
- Spanning eulerian subgraphs, the splitting lemma, and Petersen's theorem
- On 2-factors in claw-free graphs
- On a closure concept in claw-free graphs
- On the number of components in 2-factors of claw-free 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
- Regular factors in K1,3‐free graphs
- Regular factors in K1,n free graphs
- A Reduction Method for Edge-Connectivity in Graphs
- Closure, 2-factors, and cycle coverings in claw-free graphs
- Two-factors with few cycles in claw-free graphs
This page was built for publication: Even subgraphs of bridgeless graphs and 2-factors of line graphs
