On connected (,k)-critical graphs
From MaRDI portal
Publication:3565853
zbMATH Open1196.05064MaRDI QIDQ3565853FDOQ3565853
Authors: Doost Ali Mojdeh, P. Firoozi, Roslan Hasni 
Publication date: 7 June 2010
Recommendations
Extremal problems in graph theory (05C35) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Cited In (25)
- Outer-2-independent domination in graphs
- Maximal \(3\)-\(\gamma\)-vertex-critical graphs
- 2.5-connectivity: unique components, critical graphs, and applications
- Title not available (Why is that?)
- On \(k\)-critical \(2 k\)- connected graphs
- Few more results in domatically co-critical graphs
- Title not available (Why is that?)
- A note on -vertex critical graphs
- On the existence of \((k,l)\)-critical graphs
- Title not available (Why is that?)
- On the size of \((K_t,\mathcal{T}_k)\)-co-critical graphs
- Proof of Mader's conjecture on k‐critical n‐connected graphs
- Construction of (\(\gamma, k\))-critical graphs
- Title not available (Why is that?)
- Title not available (Why is that?)
- Disconnected \(g_c\)-critical graphs
- On locally \(k\)-critically \(n\)-connected graphs
- Title not available (Why is that?)
- Characteristics of \((\gamma,3)\)-critical graphs
- Title not available (Why is that?)
- Coalescence and criticality of graphs
- The existence problem of \(k\mathrm{-}\gamma_t\)-critical graphs
- A characterization of \(3\)-\((\gamma _{c}, 2)\)-critical claw-free graphs which are not \(3\)-\(\gamma _{c }\)-critical
- \(S\)-packing chromatic vertex-critical graphs
- Title not available (Why is that?)
This page was built for publication: On connected \((\gamma,k)\)-critical graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3565853)
