A note on domination 3-edge-critical planar graphs

DOI10.1016/J.IPL.2018.10.014OpenAlexW2898598530WikidataQ129047301 ScholiaQ129047301MaRDI QIDQ1628690

Michitaka Furuya, Naoki Matsumoto

Publication date: 5 December 2018

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2018.10.014

zbMATH Keywords

combinatorial problemsplanar graphbicritical graphdomination 3-edge-critical graph

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (1)

Hamiltonicity of \(3_t\)EC graphs with \(\alpha=\kappa +1\)

Cites Work

• A conjecture on \(k\)-factor-critical and 3-\(\gamma \)-critical graphs
• Some results related to the toughness of 3-domination critical graphs
• Matching properties in domination critical graphs.
• Hamilton-connectivity of 3-domination critical graphs with \(\alpha = \delta + 2\)
• Codiameters of 3-connected 3-domination critical graphs
• Hamiltonian properties of domination-critical graphs
• Domination critical graphs

This page was built for publication: A note on domination 3-edge-critical planar graphs