Connection between conjunctive capacity and structural properties of graphs
DOI10.1016/j.tcs.2014.04.035zbMath1383.05254OpenAlexW1993774188MaRDI QIDQ744094
Miroslav Chlebík, Janka Chlebíková
Publication date: 6 October 2014
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2014.04.035
binding numbercompound channelfractional vertex covergraph capacitiesShannon capacity for graph familiesstrong crown decomposition
Programming involving graphs or networks (90C35) Convex programming (90C25) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Information theory (general) (94A15)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A Sperner-type theorem and qualitative independence
- Capacities: From information theory to extremal set theory
- Capacities of graphs and \(2\)-matchings
- Computing the binding number of a graph
- Sperner capacities
- Crown reductions for the minimum weighted vertex cover problem
- Which rational numbers are binding numbers?
- The binding number of a graph and its Anderson number
This page was built for publication: Connection between conjunctive capacity and structural properties of graphs
