Forbidden pairs and the existence of a dominating cycle
From MaRDI portal
Publication:2515588
DOI10.1016/j.disc.2015.06.018zbMath1318.05051arXiv1502.02159OpenAlexW1805866081MaRDI QIDQ2515588
Shoichi Tsuchiya, Shuya Chiba, Michitaka Furuya
Publication date: 5 August 2015
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1502.02159
Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Eulerian and Hamiltonian graphs (05C45)
Related Items (7)
Characterizing forbidden pairs for relative length of longest paths and cycles ⋮ Dominating cycles and forbidden pairs containing \(P_5\) ⋮ Forbidden set of induced subgraphs for 2-connected supereulerian graphs ⋮ Edge-diameter of a graph and its longest cycles ⋮ Circumference of a graph and its distance dominating longest cycles ⋮ Forbidden pairs for equality of connectivity and edge-connectivity of graphs ⋮ On the dominating (induced) cycles of iterated line graphs
Cites Work
- How many conjectures can you stand? A survey
- On \(2\)-factors in \(r\)-connected \(\{K_{1,k},P_4\}\)-free graphs
- Paw-free graphs
- Forbidden subgraphs and Hamiltonian properties and graphs
- Forbidden subgraphs, hamiltonicity and closure in claw-free graphs
- On a closure concept in claw-free graphs
- Characterizing forbidden pairs for hamiltonian properties
- Advances on the Hamiltonian problem -- a survey
- On some intriguing problems in Hamiltonian graph theory---a survey
- Forbidden subgraphs that imply 2-factors
- A pair of forbidden subgraphs and perfect matchings.
- On a property of the class of n-colorable graphs
- Every 3‐connected claw‐free Z 8 ‐free graph is Hamiltonian
- Claw-free 3-connectedP11-free graphs are hamiltonian
- Hamiltonian results inK1,3-free graphs
- A degree sum condition for longest cycles in 3-connected graphs
- Forbidden Subgraphs for Hamiltonicity of 3-Connected Claw-Free Graphs
- Hamiltonicity and forbidden subgraphs in 4‐connected graphs
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Forbidden pairs and the existence of a dominating cycle
