On tight components and anti-tight components
From MaRDI portal
Publication:897283
Recommendations
- Factor-critical graphs with the minimum number of near-perfect matchings
- 2-connected factor-critical graphs \(G\) with exactly \(|E(G)| + 1\) maximum matchings
- Factor-critical graphs with given number of maximum matchings
- scientific article; zbMATH DE number 1191210
- Factor-critical graph \(G\) with \(|V (G)|+2\) maximum matchings
Cites work
- scientific article; zbMATH DE number 3437188 (Why is no real title available?)
- Bisections of graphs
- Extremal graphs for intersecting triangles
- Factor-critical graphs with given number of maximum matchings
- Judicious partitions and related problems
- Mycielskians and matchings
- Problems and results on judicious partitions
- \((2,k)\)-factor-critical graphs and toughness
Cited in
(11)- On bisections of graphs without complete bipartite graphs
- On bisections of directed graphs
- Bisections of graphs without short cycles
- Max-bisections of \(H\)-free graphs
- A bound on judicious bipartitions of directed graphs
- Partitioning digraphs with outdegree at least 4
- Bisections of graphs without \(K_{2, l}\)
- Graph partitioning: an updated survey
- On bipartitions of directed graphs with small semidegree
- A note on judicious bisections of graphs
- On judicious bipartitions of directed graphs
This page was built for publication: On tight components and anti-tight components
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q897283)
