Mixed hypergraphs with bounded degree: Edge-coloring of mixed multigraphs.

DOI10.1016/S0304-3975(02)00408-5zbMath1051.68114DBLPjournals/tcs/KralKV03OpenAlexW2081804694WikidataQ57601598 ScholiaQ57601598MaRDI QIDQ1401245

Jan Kratochvíl, Daniel Král', Heinz-Juergen Voss

Publication date: 17 August 2003

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0304-3975(02)00408-5

zbMATH Keywords

Approximation algorithms for coloringColoring of hypergraphsMixed hypergraphs

Mathematics Subject Classification ID

Hypergraphs (05C65) Graph theory (including graph drawing) in computer science (68R10) Coloring of graphs and hypergraphs (05C15) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (6)

Maximum number of colors in hypertrees of bounded degree ⋮ Non-monochromatic non-rainbow colourings of \(\sigma\)-hypergraphs ⋮ Coloring mixed hypertrees ⋮ Rainbow faces in edge‐colored plane graphs ⋮ Color-bounded hypergraphs. I: General results ⋮ Approximability of the upper chromatic number of hypergraphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Maximum bounded 3-dimensional matching is MAX SNP-complete
• Monochromatic vs multicolored paths
• On approximation properties of the independent set problem for low degree graphs
• Bicoloring Steiner triple systems
• Upper chromatic number of Steiner triple and quadruple systems
• Strict colouring for classes of Steiner triple systems
• The chromatic spectrum of mixed hypergraphs
• Towards a Large Set of Steiner Quadruple Systems
• Efficiency of a Good But Not Linear Set Union Algorithm
• Maximum matching and a polyhedron with 0,1-vertices

This page was built for publication: Mixed hypergraphs with bounded degree: Edge-coloring of mixed multigraphs.