Hamiltonicities of double domination critical and stable claw-free graphs
From MaRDI portal
Publication:2416952
DOI10.7151/dmgt.2148zbMath1411.05207OpenAlexW2887637052WikidataQ129443606 ScholiaQ129443606MaRDI QIDQ2416952
Publication date: 27 May 2019
Published in: Discussiones Mathematicae. Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.7151/dmgt.2148
Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Eulerian and Hamiltonian graphs (05C45)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Some matching properties in \(4-\gamma_{\times 2}\)-critical graphs
- Hamiltonicity in 3-domination-critical graphs with \(\alpha= \delta+2\)
- Forbidden subgraphs, hamiltonicity and closure in claw-free graphs
- Some properties of 3-domination-critical graphs
- On a closure concept in claw-free graphs
- Hamilton cycles in 3-connected claw-free and net-free graphs
- Tough graphs and Hamiltonian circuits.
- 3-factor-criticality in double domination edge critical graphs
- Hamiltonian properties of domination-critical graphs
- MATCHING PROPERTIES IN DOUBLE DOMINATION EDGE CRITICAL GRAPHS
- Independence and hamiltonicity in 3-domination-critical graphs
- Some 3‐connected 4‐edge‐critical non‐Hamiltonian graphs
- Domination critical graphs
This page was built for publication: Hamiltonicities of double domination critical and stable claw-free graphs
