Fractional covering by cuts

DOI10.1016/J.ENDM.2005.06.099MaRDI QIDQ3439381zbMATH OpenOpenAlexFDO

Authors Robert Šámal

Publication date 29 May 2007

Published in Electronic Notes in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.endm.2005.06.099

zbMATH Keywords

coveringcutcut-continuous mappingsfractional

Mathematics Subject Classification ID

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

Recommendations

• Cubical coloring -- fractional covering by cuts and semidefinite programming
• On fractional cut covers
• Covering a graph with cuts of minimum total size
• A note on fractional covers of a graph
• scientific article; zbMATH DE number 4075125

Cites work

• Facets of the Bipartite Subgraph Polytope
• Maximum bipartite subgraphs of Kneser graphs
• Tension continuous maps -- their structure and applications
• Weakly bipartite graphs and the max-cut problem

Cited in

(4)

• On fractional cut covers
• Properties of an approximability-related parameter on circular complete graphs
• Approximability Distance in the Space of H-Colourability Problems
• Cubical coloring -- fractional covering by cuts and semidefinite programming

This page was built for publication: Fractional covering by cuts

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