On the dominating (induced) cycles of iterated line graphs
From MaRDI portal
Publication:2104921
DOI10.1016/j.dam.2022.09.025OpenAlexW4307838003MaRDI QIDQ2104921
Publication date: 8 December 2022
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2022.09.025
Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Graph operations (line graphs, products, etc.) (05C76)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Hamiltonian claw-free graphs and \(o\)-heavy graphs involving induced cycles
- Outerplanarity of line graphs and iterated line graphs
- Hamiltonian index is NP-complete
- The strong perfect graph theorem
- The existence of even factors in iterated line graphs
- \(k\)-ordered hamiltonicity of iterated line graphs
- Hamilton-connected indices of graphs
- Existence of Dlambda-cycles and Dlambda-paths
- On the Hamiltonian index
- Existence of dominating cycles and paths
- Equivalence of Fleischner's and Thomassen's conjectures
- Hamiltonian iterated line graphs
- Planarity of iterated line graphs
- Linkability in iterated line graphs
- Forbidden pairs and the existence of a dominating cycle
- The connectivity of line-graphs
- The structure and existence of 2-factors in iterated line graphs
- The Planar Hamiltonian Circuit Problem is NP-Complete
- The existence of complete cycles in repeated line-graphs
- Iterated line graphs are maximally ordered
- On Eulerian and Hamiltonian Graphs and Line Graphs
- On Hamiltonian Line-Graphs
- Connectivity of iterated line graphs
- Connectivity of iterated line graphs
This page was built for publication: On the dominating (induced) cycles of iterated line graphs