A conjecture on k-factor-critical and 3- -critical graphs
From MaRDI portal
(Redirected from Publication:989762)
A conjecture on \(k\)-factor-critical and 3-\(\gamma \)-critical graphs
A conjecture on \(k\)-factor-critical and 3-\(\gamma \)-critical graphs
Recommendations
- 3-factor-criticality in domination critical graphs
- On the connectivity and matchings in 3-vertex-critical claw-free graphs
- Factor-critical property in 3-dominating-critical graphs
- A characterization of \(3\)-\(\gamma\)-critical graphs which are not bicritical
- Matching properties in domination critical graphs.
Cites work
- scientific article; zbMATH DE number 238423 (Why is no real title available?)
- 3-factor-criticality in domination critical graphs
- Factor-criticality and matching extension in DCT-graphs
- Hamiltonian properties of domination-critical graphs
- Hamiltonicity in 3-domination-critical graphs with = +2
- Independence and hamiltonicity in 3-domination-critical graphs
- Matching properties in domination critical graphs.
- Matchings in 3‐vertex‐critical graphs: The even case
- On \(k\)-factor-critical graphs
- On the connectivity and matchings in 3-vertex-critical claw-free graphs
- Some properties of 3-domination-critical graphs
- Vertex domination-critical graphs
- Vertex domination‐critical graphs
Cited in
(7)- scientific article; zbMATH DE number 2073945 (Why is no real title available?)
- A characterization of domination weak bicritical graphs with large diameter
- \((3, k)\)-factor-critical graphs and toughness
- A note on domination 3-edge-critical planar graphs
- Construction for trees without domination critical vertices
- On the connectivity and matchings in 3-vertex-critical claw-free graphs
- 3-factor-criticality in domination critical graphs
This page was built for publication: A conjecture on \(k\)-factor-critical and 3-\(\gamma \)-critical graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q989762)
