On the structure of factorizable graphs
From MaRDI portal
Cites work
- Distinct representatives of subsets
- scientific article; zbMATH DE number 3141016 (Why is no real title available?)
- scientific article; zbMATH DE number 3150487 (Why is no real title available?)
- On the 1-factors of a non-separable graph
- Paths, Trees, and Flowers
- Subgraphs with prescribed valencies
- The Factorization of Linear Graphs
Cited in
(62)- Binding number and minimum degree for the existence of \((g,f,n)\)-critical graphs
- Ear-decompositions of matching-covered graphs
- The Edmonds-Gallai decomposition for matchings in locally finite graphs
- Brick decompositions and the matching rank of graphs
- Maximal tight sets and the Edmonds-Gallai decomposition for matchings
- Undirected distances and the postman-structure of graphs
- The Schrijver system of odd join polyhedra
- A Las Vegas RNC algorithm for maximum matching
- Matching structure and the matching lattice
- The two ear theorem on matching-covered graphs
- On n-extendable graphs
- f-factors and related decompositions of graphs
- On a generalization of linecritical graphs
- Algorithmic proofs of two relations between connectivity and the 1- factors of a graph
- Matchings in regular graphs
- Matching theory -- a sampler: From Dénes König to the present
- On minimal elementary bipartite graphs
- The number of 1-factors in 2k-connected graphs
- Extending matchings in graphs: A survey
- (a,b,k)-critical graphs
- On unique \(k\)-factors and unique \([1,k]\)-factors in graphs.
- Matchings with lower quotas: algorithms and complexity
- A new degree condition for graphs to have \([a,b]\)-factor
- Counting 1-factors in infinite graphs
- Toughness and matching extension in graphs
- On the number of 1-factors of locally finite graphs
- On 2-extendable abelian Cayley graphs
- Minimum \(k\)-critical bipartite graphs
- Graft analogue of general Kotzig-Lovász decomposition
- Some tight bounds on the minimum and maximum forcing numbers of graphs
- Clique-partitioned graphs
- Spectral radius and \([a,b]\)-factors in graphs
- Irreducible decomposition of powers of edge ideals
- Hamiltonian cycle properties in k-extendable non-bipartite graphs with high connectivity
- Matching extendability and connectivity of regular graphs from eigenvalues
- A note on \(m\)-near-factor-critical graphs
- Degree conditions for graphs to be fractional (a, b, n)-critical graphs
- Construction for bicritical graphs and \(k\)-extendable bipartite graphs
- 3-factor-criticality of vertex-transitive graphs
- Rank of maximum matchings in a graph
- On the structure of graphs with a uniquek-factor
- Über die Anzahl der 1-Faktoren in 2-fach zusammenhängenden Graphen
- On graphs with a unique perfect matching
- A note on extreme sets
- The factorization of graphs. II
- On graphs that contain exactly \(k\) copies of a subgraph, and a related problem in search theory
- Minimally k-factor-critical graphs for some large k
- 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
- Basilica: new canonical decomposition in matching theory
- Perfect k-matching, k-factor-critical and A_-spectral radius
- Irreducible decomposition of powers of edge ideals, computing dstab, astab.
- k-fault-tolerant graphs for p disjoint complete graphs of order c
- Minimum k-critical-bipartite graphs: the irregular case
- 4-factor-criticality of vertex-transitive graphs
- Eigenvalues and factors: a survey
- Matching extendability in Cartesian product of hypercubes and paths
- Extending unlocked matchings in graphs
- Signed analogue of general Kotzig-Lovász decomposition
- Maximum graphs with a unique k-factor
- Elementary graphs with respect to \(f\)-parity factors
This page was built for publication: On the structure of factorizable graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5659593)
