On tight components and anti-tight components
From MaRDI portal
Publication:897283
DOI10.1007/S00373-015-1529-2zbMATH Open1327.05277OpenAlexW1979907972WikidataQ59411118 ScholiaQ59411118MaRDI QIDQ897283FDOQ897283
Authors: Kan Wang, Xingxing Yu, Changhong Lu 
Publication date: 17 December 2015
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00373-015-1529-2
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
- Extremal graphs for intersecting triangles
- Judicious partitions and related problems
- Bisections of graphs
- Problems and results on judicious partitions
- Title not available (Why is that?)
- Factor-critical graphs with given number of maximum matchings
- \((2,k)\)-factor-critical graphs and toughness
- Mycielskians and matchings
Cited In (11)
- On bisections of graphs without complete bipartite graphs
- Bisections of Graphs Without Short Cycles
- Bisections of graphs without \(K_{2, l}\)
- On bipartitions of directed graphs with small semidegree
- Graph partitioning: an updated survey
- Max-bisections of \(H\)-free graphs
- A bound on judicious bipartitions of directed graphs
- On judicious bipartitions of directed graphs
- On bisections of directed graphs
- Partitioning digraphs with outdegree at least 4
- A note on judicious bisections of 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)
