Some matching properties in 4-_ 2-critical graphs
From MaRDI portal
Publication:980258
DOI10.1016/J.CAMWA.2009.10.024zbMATH Open1189.05146OpenAlexW2063019779MaRDI QIDQ980258FDOQ980258
Authors: Erfang Shan, Haichao Wang 
Publication date: 28 June 2010
Published in: Computers & Mathematics with Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.camwa.2009.10.024
Recommendations
- Matchings in \(4\)-total restrained domination vertex critical graphs.
- On \(4\)-\(\gamma_t\)-critical graphs of diameter two
- On 4-\gamma_t-critical graphs of order 4+\Delta(G)
- On 4-\(\gamma_c\)-critical graphs with cut-vertices
- Matching properties in total domination vertex critical graphs
- Matching properties in connected domination critical graphs
- The structure of \(4-\gamma \)-critical graphs with a cut vertex
- scientific article; zbMATH DE number 5656434
- The \(k\)-critical \(2k\)-connected graphs for \(k\in\{3,4\}\)
- \(4_t\)-critical graphs with maximum diameter
Cites Work
- Graph theory
- Title not available (Why is that?)
- On \(k\)-factor-critical graphs
- Characterizations of trees with equal paired and double domination numbers
- A note on Nordhaus-Gaddum inequalities for domination.
- Extending matchings in claw-free graphs
- Independent and double domination in trees
- Title not available (Why is that?)
Cited In (4)
This page was built for publication: Some matching properties in \(4-\gamma_{\times 2}\)-critical graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q980258)
