Matchings in 3-vertex-critical graphs: the odd case
From MaRDI portal
Publication:879342
DOI10.1016/J.DISC.2006.09.015zbMATH Open1133.05073OpenAlexW2090169885MaRDI QIDQ879342FDOQ879342
N. Ananchuen, Michael D. Plummer
Publication date: 11 May 2007
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2006.09.015
Recommendations
- Matchings in 3‐vertex‐critical graphs: The even case
- Matching and factor-critical property in 3-domination-critical graphs
- Matchings in 3-uniform hypergraphs
- Matchings in 3-uniform hypergraphs of large minimum vertex degree
- A conjecture on 3-vertex-critical graphs
- Matching in 3-uniform hypergraphs
- On the connectivity and matchings in 3-vertex-critical claw-free graphs
- scientific article; zbMATH DE number 1916558
- Matchings in graphs of odd regularity and girth
- scientific article; zbMATH DE number 1916568
Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Cites Work
Cited In (7)
- Factor-critical property in 3-dominating-critical graphs
- A characterization of domination weak bicritical graphs with large diameter
- Construction for trees without domination critical vertices
- Matching properties in total domination vertex critical graphs
- MATCHING PROPERTIES IN DOUBLE DOMINATION EDGE CRITICAL GRAPHS
- On the Structure of Graphs Vertex Critical with Respect to Connected Domination
- 3-factor-criticality in double domination edge critical graphs
This page was built for publication: Matchings in 3-vertex-critical graphs: the odd case
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q879342)
