Coloring mixed hypertrees

DOI10.1016/j.dam.2005.05.019zbMath1088.05031DBLPjournals/dam/KralKPV06OpenAlexW2007023458WikidataQ57601527 ScholiaQ57601527MaRDI QIDQ2489959

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

Publication date: 28 April 2006

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2005.05.019

zbMATH Keywords

graph coloringmixed hypergraphshypertrees

Mathematics Subject Classification ID

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

Related Items (6)

Unnamed Item ⋮ Concepts on coloring of cluster hypergraphs with application ⋮ A note on rainbow-free colorings of uniform hypergraphs ⋮ The complexity of surjective homomorphism problems-a survey ⋮ On rainbow-free colourings of uniform hypergraphs ⋮ Approximability of the upper chromatic number of hypergraphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Monochromatic vs multicolored paths
• Bicoloring Steiner triple systems
• Mixed interval hypergraphs
• Upper chromatic number of Steiner triple and quadruple systems
• Strict colouring for classes of Steiner triple systems
• Mixed hypergraphs with bounded degree: Edge-coloring of mixed multigraphs.
• About the upper chromatic number of a co-hypergraph
• Colouring planar mixed hypergraphs
• Uniquely colorable mixed hypergraphs
• The chromatic spectrum of mixed hypergraphs
• Coloring mixed hypergraphs: theory, algorithms and applications
• On feasible sets of mixed hypergraphs
• Uncolorable mixed hypergraphs
• Towards a Large Set of Steiner Quadruple Systems
• Graph Classes: A Survey
• About uniquely colorable mixed hypertrees
• Gaps in the chromatic spectrum of face-constrained plane graphs
• On planar mixed hypergraphs

This page was built for publication: Coloring mixed hypertrees