Traceability of connected domination critical graphs
From MaRDI portal
Publication:2656675
DOI10.1016/j.amc.2020.125455zbMath1462.05279arXiv1906.08727OpenAlexW3039008912MaRDI QIDQ2656675
Michael A. Henning, Pawaton Kaemawichanurat, Nawarat Ananchuen
Publication date: 16 March 2021
Published in: Applied Mathematics and Computation (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1906.08727
Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Connectivity (05C40) Eulerian and Hamiltonian graphs (05C45)
Related Items
Connected domination critical graphs with a block having maximum number of cut vertices ⋮ Connected Domination
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Connected domination number of a graph and its complement
- Connected domination of regular graphs
- Permutation graphs: Connected domination and Steiner trees
- Maximum number of edges in connected graphs with a given domination number
- Hamiltonicity in 3-domination-critical graphs with \(\alpha= \delta+2\)
- Some properties of 3-domination-critical graphs
- A short note on the approximability of the maximum leaves spanning tree problem
- Connected domination critical graphs.
- Tractable connected domination for restricted bipartite graphs
- Bounds on the connected domination number of a graph
- Hamiltonian properties of domination-critical graphs
- Distance-Hereditary Graphs, Steiner Trees, and Connected Domination
- Independence and hamiltonicity in 3-domination-critical graphs
- Connected Domination and Spanning Trees with Many Leaves
- Total Domination in Graphs
- On domination critical graphs with cutvertices having connected domination number 3
- Some 3‐connected 4‐edge‐critical non‐Hamiltonian graphs
- Domination critical graphs
This page was built for publication: Traceability of connected domination critical graphs
