On the conjunctive capacity of graphs

DOI10.1007/978-3-642-38768-5_26MaRDI QIDQ4925245zbMATH OpenOpenAlexFDO

Authors Miroslav Chlebík, Janka Chlebíková

Publication date 11 June 2013

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://researchportal.port.ac.uk/portal/en/publications/on-the-conjunctive-capacity-of-graphs(ebfde120-fcd8-4dd1-b025-aef1c9b1380e).html

zbMATH Keywords

binding numbercompound channelfractional vertex covergraph capacitiesShannon capacity for graph familiesstrong crown decomposition

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Convex programming (90C25) Programming involving graphs or networks (90C35) Information theory (general) (94A15)

Recommendations

• Connection between conjunctive capacity and structural properties of graphs
• The Shannon capacity of a union
• An Analogue of the Shannon Capacity of a Graph
• scientific article; zbMATH DE number 826055
• On the Shannon capacity of a graph

Cited in

(5)

• Capacities of graphs and \(2\)-matchings
• On the capacity of Boolean graph formulæ
• Intersection number and capacities of graphs
• Hofer-Zehnder capacity and Bruhat graph
• Connection between conjunctive capacity and structural properties of graphs

This page was built for publication: On the conjunctive capacity of graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4925245)