Closure operation for even factors on claw-free graphs
From MaRDI portal
Publication:2275395
DOI10.1016/j.disc.2011.04.009zbMath1235.05116MaRDI QIDQ2275395
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
05C35: Extremal problems in graph theory
05C38: Paths and cycles
05C70: Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)
Related Items
Forbidden pairs of disconnected graphs for supereulerianity of connected graphs, Induced hourglass and the equivalence between Hamiltonicity and supereulerianity in claw-free graphs, Induced claws and existence of even factors of graphs, Pairs of forbidden subgraphs and 2-connected supereulerian graphs, A neighborhood union condition for fractional \((a, b, k)\)-critical covered graphs, Even factors with a bounded number of components in iterated line 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