scientific article; zbMATH DE number 238423
From MaRDI portal
Publication:5287862
Cited in
(50)- Binding number and minimum degree for the existence of \((g,f,n)\)-critical graphs
- Matching extension and the genus of a graph
- (a,b,k)-critical graphs
- Matchings and matching extensions in graphs
- Matching connectivity: on the structure of graphs with perfect matchings
- A new degree condition for graphs to have \([a,b]\)-factor
- Characterizations of maximum matching graphs of certain types
- Characterizing \(2k\)-critical graphs and \(n\)-extendable graphs
- On Cartesian product of factor-critical graphs
- Minimum size of n-factor-critical graphs and k-extendable graphs
- Perfect matchings and \(K_{1,p}\)-restricted graphs
- On extendability of co-edge-regular graphs
- Minimum \(k\)-critical bipartite graphs
- Hamiltonian cycle properties in k-extendable non-bipartite graphs with high connectivity
- A note on \(m\)-near-factor-critical graphs
- On extendability of Deza graphs with diameter 2
- Generalization of matching extensions in graphs. II.
- On the extendability of quasi-strongly regular graphs with diameter 2
- Degree conditions for graphs to be fractional (a, b, n)-critical graphs
- Some results on fractional n-factor-critical graphs
- Characterizing defect n-extendable graphs and (2n+1)-critical graphs
- On edge-colored graphs covered by properly colored cycles
- 3-factor-criticality of vertex-transitive graphs
- Generalization of matching extensions in graphs. IV: Closures
- A note onn-extendable graphs
- The extendability of matchings in strongly regular graphs
- scientific article; zbMATH DE number 1563920 (Why is no real title available?)
- On three extensions of equimatchable graphs
- Max-cut and extendability of matchings in distance-regular graphs
- Generalization of matching extensions in graphs. III
- Generalization of matching extensions in graphs
- Maximizing the minimum and maximum forcing numbers of perfect matchings of graphs
- Perfect matchings in graphs with prescribed local restrictions
- 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
- Minimum degree of minimal (n-10)-factor-critical graphs
- Perfect integer k-matching, k-factor-critical, and the spectral radius of graphs
- The classification of \(2\)-extendable edge-regular graphs with diameter \(2\)
- Spectral conditions for k-extendability and k-factors of bipartite graphs
- On the fractional matching extendability of Cayley graphs of abelian groups
- Perfect k-matching, k-factor-critical and A_-spectral radius
- k-fault-tolerant graphs for p disjoint complete graphs of order c
- Minimum k-critical-bipartite graphs: the irregular case
- Minimum degree of minimal \(k\)-factor-critical triangle-free graphs with \(k \geq \frac{n - 8}{3}\)
- 4-factor-criticality of vertex-transitive graphs
- Sufficient conditions for a graph with minimum degree to be \(k\)-critical with respect to an odd \([1,b]\)-factor
- Characterizing defect n-extendable bipartite graphs with different connectivities
- A conjecture on \(k\)-factor-critical and 3-\(\gamma \)-critical graphs
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5287862)
