Connection between conjunctive capacity and structural properties of graphs
DOI10.1016/J.TCS.2014.04.035zbMATH Open1383.05254OpenAlexW1993774188MaRDI QIDQ744094FDOQ744094
Authors: 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
Recommendations
- On the conjunctive capacity of graphs
- Connectednesses of graphs and congruences
- On the connectivity of configuration graphs
- On the capacity of graphs
- Relative capacity and dimension of graphs
- Connected graphs and their connectivities
- On the connectivity of graphs in association schemes
- scientific article; zbMATH DE number 4023324
- scientific article; zbMATH DE number 3865327
- The complexity of graph connectivity
binding numbercompound channelfractional vertex covergraph capacitiesShannon capacity for graph familiesstrong crown decomposition
Convex programming (90C25) Programming involving graphs or networks (90C35) Information theory (general) (94A15) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Crown reductions for the minimum weighted vertex cover problem
- The binding number of a graph and its Anderson number
- Capacities: From information theory to extremal set theory
- Computing the binding number of a graph
- Sperner capacities
- Title not available (Why is that?)
- Capacities of graphs and \(2\)-matchings
- Which rational numbers are binding numbers?
- A Sperner-type theorem and qualitative independence
Cited In (1)
This page was built for publication: Connection between conjunctive capacity and structural properties of graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q744094)
