The structure of 4- -critical graphs with a cut vertex

DOI10.1016/J.DISC.2010.05.029zbMATH Open1210.05091OpenAlexW1968784647MaRDI QIDQ708397FDOQ708397

N. Ananchuen, R. E. L. Aldred, W. Ananchuen

Publication date: 11 October 2010

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2010.05.029

Recommendations

• On 4-\(\gamma_c\)-critical graphs with cut-vertices
• Matching of \(5-\gamma \)-critical leafless graph with a cut edge
• Matching properties in domination critical graphs.
• A conjecture on 3-vertex-critical graphs
• Matchings in 3‐vertex‐critical graphs: The even case

zbMATH Keywords

dominationedge-critical graph

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Cites Work

• Graph theory
• Domination critical graphs
• Title not available (Why is that?)
• Some results related to the toughness of 3-domination critical graphs
• Matching properties in domination critical graphs.
• 3-factor-criticality in domination critical graphs
• Some results related to the toughness of 3-domination critical graphs. II
• Hamiltonian properties of domination-critical graphs
• Title not available (Why is that?)
• A new proof of Wojcicka's conjecture
• Hamilton-connectivity of 3-domination critical graphs with \(\alpha =\delta +1\geqslant 5\)

Cited In (4)

• Some matching properties in \(4-\gamma_{\times 2}\)-critical graphs
• Title not available (Why is that?)
• Matching of \(5-\gamma \)-critical leafless graph with a cut edge
• The numbers of cut-vertices and end-blocks in 4-regular graphs

This page was built for publication: The structure of \(4-\gamma \)-critical graphs with a cut vertex

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q708397)