On the structure of factorizable graphs
From MaRDI portal
Publication:5659593
DOI10.1007/BF01889914zbMath0247.05156MaRDI QIDQ5659593
Publication date: 1972
Published in: Acta Mathematica Academiae Scientiarum Hungaricae (Search for Journal in Brave)
Related Items
Clique-partitioned graphs, Maximal tight sets and the Edmonds-Gallai decomposition for matchings, Spectral radius and \([a,b\)-factors in graphs], Undirected distances and the postman-structure of graphs, The Schrijver system of odd join polyhedra, A Las Vegas RNC algorithm for maximum matching, On 2-extendable abelian Cayley graphs, Matching structure and the matching lattice, \((a,b,k)\)-critical graphs, Irreducible decomposition of powers of edge ideals, The two ear theorem on matching-covered graphs, On graphs that contain exactly \(k\) copies of a subgraph, and a related problem in search theory, Hamiltonian cycle properties in \(k\)-extendable non-bipartite graphs with high connectivity, On n-extendable graphs, Minimally \(k\)-factor-critical graphs for some large \(k\), f-factors and related decompositions of graphs, The factorization of graphs. II, Matching extension and distance spectral radius, On a generalization of linecritical graphs, Minimum degree of minimal \((n-10)\)-factor-critical graphs, Algorithmic proofs of two relations between connectivity and the 1- factors of a graph, Matchings with lower quotas: algorithms and complexity, Matchings in regular graphs, On unique \(k\)-factors and unique \([1,k\)-factors in graphs.], Degree conditions for graphs to be fractional \((a, b, n)\)-critical graphs, On graphs with a unique perfect matching, Matching theory -- a sampler: From Dénes König to the present, Elementary graphs with respect to \(f\)-parity factors, A new degree condition for graphs to have \([a,b\)-factor], Construction for bicritical graphs and \(k\)-extendable bipartite graphs, On the structure of graphs with a uniquek-factor, 4-factor-criticality of vertex-transitive graphs, On minimal elementary bipartite graphs, 3-Factor-Criticality of Vertex-Transitive Graphs, The number of 1-factors in 2k-connected graphs, Minimum \(k\)-critical bipartite graphs, Matching extendability and connectivity of regular graphs from eigenvalues, Counting 1-factors in infinite graphs, A note on \(m\)-near-factor-critical graphs, Toughness and matching extension in graphs, Binding number and minimum degree for the existence of \((g,f,n)\)-critical graphs, Signed analogue of general Kotzig-Lovász decomposition, Rank of maximum matchings in a graph, Graft analogue of general Kotzig-Lovász decomposition, On the number of 1-factors of locally finite graphs, Maximum graphs with a unique k-factor, Ear-decompositions of matching-covered graphs, A note on extreme sets, The Edmonds-Gallai decomposition for matchings in locally finite graphs, Brick decompositions and the matching rank of graphs, Some tight bounds on the minimum and maximum forcing numbers of graphs, Über die Anzahl der 1-Faktoren in 2-fach zusammenhängenden Graphen, Extending matchings in graphs: A survey
Cites Work
