On k-factor-critical graphs
From MaRDI portal
Publication:2785649
DOI10.7151/dmgt.1022zbMath0865.05061OpenAlexW1970805731MaRDI QIDQ2785649
Publication date: 25 February 1997
Published in: Discussiones Mathematicae Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.7151/dmgt.1022
Related Items (39)
Generalization of matching extensions in graphs. II. ⋮ Characterizing \(2k\)-critical graphs and \(n\)-extendable graphs ⋮ On the \(p\)-factor-criticality of the Klein bottle ⋮ 3-factor-criticality in double domination edge critical graphs ⋮ Generalization of matching extensions in graphs. IV: Closures ⋮ A characterization of maximal non-\(k\)-factor-critical graphs ⋮ On Cartesian product of factor-critical graphs ⋮ Minimum size of \(n\)-factor-critical graphs and \(k\)-extendable graphs ⋮ Hamiltonian cycle properties in \(k\)-extendable non-bipartite graphs with high connectivity ⋮ The maximum matching extendability and factor-criticality of 1-planar graphs ⋮ Minimally \(k\)-factor-critical graphs for some large \(k\) ⋮ Some sufficient conditions for a graph with minimum degree to be \(k\)-factor-critical ⋮ Matching extension and distance spectral radius ⋮ NEIGHBOURHOODS OF INDEPENDENT SETS FOR (a,b,k)-CRITICAL GRAPHS ⋮ Minimum degree of minimal \((n-10)\)-factor-critical graphs ⋮ On the Structure of Graphs Vertex Critical with Respect to Connected Domination ⋮ Graph toughness from Laplacian eigenvalues ⋮ A characterization of \(3\)-\(\gamma\)-critical graphs which are not bicritical ⋮ Degree conditions for graphs to be fractional \((a, b, n)\)-critical graphs ⋮ 3-factor-criticality in domination critical graphs ⋮ BIPARTITE MATCHING EXTENDABILITY AND TOUGHNESS ⋮ Some results on fractional \(n\)-factor-critical graphs ⋮ The (\(n\), \(k\))-extendable graphs in surfaces ⋮ Generalization of matching extensions in graphs. III ⋮ A new degree condition for graphs to have \([a,b\)-factor] ⋮ Toughness in graphs -- a survey ⋮ Some matching properties in \(4-\gamma_{\times 2}\)-critical graphs ⋮ A conjecture on \(k\)-factor-critical and 3-\(\gamma \)-critical graphs ⋮ 4-factor-criticality of vertex-transitive graphs ⋮ 3-Factor-Criticality of Vertex-Transitive Graphs ⋮ Minimum \(k\)-critical bipartite graphs ⋮ Characterizing defect \(n\)-extendable graphs and \((2n+1)\)-critical graphs ⋮ A note on \(m\)-near-factor-critical graphs ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Independence number, connectivity and \((a,b,k)\)-critical graphs ⋮ Neighborhood unions and factor critical graphs ⋮ Matching preclusion for cube-connected cycles ⋮ The characterization of \(p\)-factor-critical graphs
This page was built for publication: On k-factor-critical graphs
