Contractibility techniques as a closure concept
From MaRDI portal
Recommendations
Cited in
(14)- Contractible Subgraphs, Thomassen's Conjecture and the Dominating Cycle Conjecture for Snarks
- How many conjectures can you stand? A survey
- Closure concept for 2-factors in claw-free graphs
- Contractible subgraphs, Thomassen's conjecture and the dominating cycle conjecture for snarks
- Hamilton‐connected {claw, net}‐free graphs, I
- Contractions of closure systems
- The \(*\)-closure for graphs and claw-free graphs
- Closure operation for even factors on claw-free graphs
- Degree conditions on induced claws
- Stability of hereditary graph classes under closure operations
- A note on singular edges and Hamiltonicity in claw-free graphs with locally disconnected vertices
- The edge-closure of a claw-free graph is the line graph of a multigraph.
- Hamilton‐connected {claw,net}‐free graphs, II
- Systematization of a set of closure techniques
This page was built for publication: Contractibility techniques as a closure concept
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4808405)