On tight components and anti-tight components

DOI10.1007/s00373-015-1529-2zbMath1327.05277OpenAlexW1979907972WikidataQ59411118 ScholiaQ59411118MaRDI QIDQ897283

Xingxing Yu, Kan Wang, Chang-hong 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

zbMATH Keywords

perfect matchingtight componentanti-tight component

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (10)

On judicious bipartitions of directed graphs ⋮ Partitioning digraphs with outdegree at least 4 ⋮ On bisections of graphs without complete bipartite graphs ⋮ Graph partitioning: an updated survey ⋮ Bisections of Graphs Without Short Cycles ⋮ Bisections of graphs without \(K_{2, l}\) ⋮ On bipartitions of directed graphs with small semidegree ⋮ Max-bisections of \(H\)-free graphs ⋮ A bound on judicious bipartitions of directed graphs ⋮ On bisections of directed graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Bisections of graphs
• Factor-critical graphs with given number of maximum matchings
• \((2,k)\)-factor-critical graphs and toughness
• Extremal graphs for intersecting triangles
• Problems and results on judicious partitions
• Mycielskians and matchings

This page was built for publication: On tight components and anti-tight components