On the connectivity and matchings in 3-vertex-critical claw-free graphs

MaRDI QIDQ5488334zbMATH OpenFDO

Authors Michael D. Plummer, N. Ananchuen

Publication date 14 September 2006

zbMATH Keywords

dominating setdominating number\(\gamma \)-vertex-critical graph

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Connectivity (05C40) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Recommendations

• 3-factor-criticality in domination critical graphs
• Factor-critical property in 3-dominating-critical graphs
• A conjecture on \(k\)-factor-critical and 3-\(\gamma \)-critical graphs
• Matchings in 3‐vertex‐critical graphs: The even case
• Matching and factor-critical property in 3-domination-critical graphs

Cited in

(8)

• Factor-critical property in 3-dominating-critical graphs
• A conjecture on \(k\)-factor-critical and 3-\(\gamma \)-critical graphs
• A twelve vertex theorem for 3-connected claw-free graphs
• On 3-stable number conditions in \(n\)-connected claw-free graphs
• Matchings in 3-vertex-critical graphs: the odd case
• Packing 3-vertex paths in claw-free graphs and related topics
• 3-factor-criticality in domination critical graphs
• On the structure of graphs vertex critical with~respect to connected domination

This page was built for publication: On the connectivity and matchings in 3-vertex-critical claw-free graphs

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