A pair of forbidden subgraphs and perfect matchings.
From MaRDI portal
Publication:2490834
Recommendations
- A pair of forbidden subgraphs and perfect matchings in graphs of high connectivity
- Forbidden induced subgraphs for perfect matchings
- A pair of forbidden subgraphs and 2-factors
- Forbidden induced subgraphs for near perfect matchings
- Forbidden pairs with a common graph generating almost the same sets
- Pairs and triples of forbidden subgraphs and the existence of a 2-factor
- Forbidden subgraphs for graphs with (near) perfect matching to be Hamiltonian
- scientific article; zbMATH DE number 1161312
- Forbidden subgraphs and bounds on the size of a maximum matching
- Forbidden pairs and the existence of a dominating cycle
Cites work
- 1-Factors and Antifactor Sets
- Characterizing forbidden pairs for hamiltonian properties
- Forbidden subgraphs and bounds on the size of a maximum matching
- scientific article; zbMATH DE number 3141016 (Why is no real title available?)
- scientific article; zbMATH DE number 1185328 (Why is no real title available?)
- scientific article; zbMATH DE number 3492724 (Why is no real title available?)
- scientific article; zbMATH DE number 1055145 (Why is no real title available?)
- Matching theory
- On partitioning the edges of graphs into connected subgraphs
Cited in
(38)- Forbidden pairs for equality of connectivity and edge-connectivity of graphs
- Forbidden induced subgraphs for perfect matchings
- Ramsey-type results for path covers and path partitions
- Characterizing forbidden pairs for relative length of longest paths and cycles
- Forbidden subgraphs on Hamiltonian index
- Forbidden pairs for the matching extendability of graphs with connectivity at least 2 or 3
- A characterization of \(P_5\)-free graphs with a homeomorphically irreducible spanning tree
- Minimal forbidden sets for degree sequence characterizations
- Forbidden set of induced subgraphs for 2-connected supereulerian graphs
- A pair of forbidden subgraphs and perfect matchings in graphs of high connectivity
- Perfect matchings avoiding prescribed edges in a star-free graph
- Forbidden pairs and the existence of a dominating cycle
- Strongly spanning trailable graphs with small circumference and Hamilton-connected claw-free graphs
- Perfect matchings avoiding several independent edges in a star-free graph
- A pair of forbidden subgraphs and 2-factors
- On the structure of graphs with exactly two near-perfect matchings.
- Forbidden triples for perfect matchings
- Forbidden subgraphs and the existence of a 2-factor
- scientific article; zbMATH DE number 1808637 (Why is no real title available?)
- Matchings defined by local conditions
- Forbidden subgraphs generating a finite set
- Forbidden induced subgraphs for near perfect matchings
- Forbidden subgraphs and the existence of a spanning tree without small degree stems
- Forbidden subgraphs and the existence of a 2-walk
- Forbidden induced subgraphs for star-free graphs
- scientific article; zbMATH DE number 1135774 (Why is no real title available?)
- Pairs of forbidden induced subgraphs for homogeneously traceable graphs
- Spectral conditions for graphs to be \(\beta\)-deficient involving minimum degree
- Forbidden Induced Subgraphs for Toughness
- Forbidden subgraphs for graphs with (near) perfect matching to be Hamiltonian
- Forbidden subgraphs and bounds on the size of a maximum matching
- Forbidden subgraphs generating almost the same sets
- Forbidden pairs of disconnected graphs for supereulerianity of connected graphs
- Ramsey-type problems on induced covers and induced partitions toward the Gyárfás-Sumner conjecture
- A Ramsey-type theorem on deficiency
- Forbidden pairs for traceability of 2-connected graphs
- Forbidden pairs for \(k\)-connected Hamiltonian graphs
- On an obstruction for perfect matchings
This page was built for publication: A pair of forbidden subgraphs and perfect matchings.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2490834)
