Pages that link to "Item:Q5659593"
From MaRDI portal
The following pages link to On the structure of factorizable graphs (Q5659593):
Displaying 50 items.
- On graphs with a unique perfect matching (Q497377) (← links)
- 4-factor-criticality of vertex-transitive graphs (Q726659) (← links)
- Signed analogue of general Kotzig-Lovász decomposition (Q777362) (← links)
- Maximum graphs with a unique k-factor (Q790832) (← links)
- Elementary graphs with respect to \(f\)-parity factors (Q968209) (← links)
- Binding number and minimum degree for the existence of \((g,f,n)\)-critical graphs (Q1032542) (← links)
- Ear-decompositions of matching-covered graphs (Q1052341) (← links)
- The Edmonds-Gallai decomposition for matchings in locally finite graphs (Q1053712) (← links)
- Brick decompositions and the matching rank of graphs (Q1055426) (← links)
- Maximal tight sets and the Edmonds-Gallai decomposition for matchings (Q1086254) (← links)
- Undirected distances and the postman-structure of graphs (Q1099186) (← links)
- The Schrijver system of odd join polyhedra (Q1101352) (← links)
- A Las Vegas RNC algorithm for maximum matching (Q1103637) (← links)
- Matching structure and the matching lattice (Q1112071) (← links)
- The two ear theorem on matching-covered graphs (Q1127879) (← links)
- On n-extendable graphs (Q1143417) (← links)
- f-factors and related decompositions of graphs (Q1147717) (← links)
- On a generalization of linecritical graphs (Q1149966) (← links)
- Algorithmic proofs of two relations between connectivity and the 1- factors of a graph (Q1153100) (← links)
- Matchings in regular graphs (Q1155070) (← links)
- Matching theory -- a sampler: From Dénes König to the present (Q1198643) (← links)
- On minimal elementary bipartite graphs (Q1245978) (← links)
- The number of 1-factors in 2k-connected graphs (Q1253256) (← links)
- Extending matchings in graphs: A survey (Q1322235) (← links)
- \((a,b,k)\)-critical graphs (Q1375824) (← links)
- On unique \(k\)-factors and unique \([1,k]\)-factors in graphs. (Q1427474) (← links)
- Matchings with lower quotas: algorithms and complexity (Q1702126) (← links)
- A new degree condition for graphs to have \([a,b]\)-factor (Q1764908) (← links)
- Counting 1-factors in infinite graphs (Q1814587) (← links)
- Toughness and matching extension in graphs (Q1824634) (← links)
- On the number of 1-factors of locally finite graphs (Q1839264) (← links)
- On 2-extendable abelian Cayley graphs (Q1903715) (← links)
- Minimum \(k\)-critical bipartite graphs (Q2043356) (← links)
- Graft analogue of general Kotzig-Lovász decomposition (Q2081503) (← links)
- Some tight bounds on the minimum and maximum forcing numbers of graphs (Q2097177) (← links)
- Clique-partitioned graphs (Q2127629) (← links)
- Spectral radius and \([a,b]\)-factors in graphs (Q2138986) (← links)
- Irreducible decomposition of powers of edge ideals (Q2178508) (← links)
- Hamiltonian cycle properties in \(k\)-extendable non-bipartite graphs with high connectivity (Q2191262) (← links)
- Matching extendability and connectivity of regular graphs from eigenvalues (Q2303429) (← links)
- A note on \(m\)-near-factor-critical graphs (Q2311372) (← links)
- Degree conditions for graphs to be fractional \((a, b, n)\)-critical graphs (Q2461313) (← links)
- Construction for bicritical graphs and \(k\)-extendable bipartite graphs (Q2497479) (← links)
- 3-Factor-Criticality of Vertex-Transitive Graphs (Q2800542) (← links)
- Rank of maximum matchings in a graph (Q3922477) (← links)
- On the structure of graphs with a uniquek-factor (Q4521492) (← links)
- Über die Anzahl der 1-Faktoren in 2-fach zusammenhängenden Graphen (Q4770981) (← links)
- A note on extreme sets (Q5006623) (← links)
- The factorization of graphs. II (Q5659592) (← links)
- On graphs that contain exactly \(k\) copies of a subgraph, and a related problem in search theory (Q6069164) (← links)
