Coloring mixed hypertrees

DOI10.1016/J.DAM.2005.05.019MaRDI QIDQ2489959zbMATH OpenOpenAlexDBLPWikidataFDO

Authors Daniel Král', Jan Kratochví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

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

Recommendations

• scientific article; zbMATH DE number 1696541
• scientific article; zbMATH DE number 1839477
• About uniquely colorable mixed hypertrees
• A note on mixed tree coloring
• Mixed colorings of hypergraphs
• scientific article; zbMATH DE number 5202627
• Mixed hypergraphs and other coloring problems
• scientific article; zbMATH DE number 5202641
• Trees in greedy colorings of hypergraphs
• Coloring mixed hypergraphs: theory, algorithms and applications

Cites work

• scientific article; zbMATH DE number 1696541 (Why is no real title available?)
• scientific article; zbMATH DE number 5145323 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 1314686 (Why is no real title available?)
• scientific article; zbMATH DE number 1341914 (Why is no real title available?)
• scientific article; zbMATH DE number 1834670 (Why is no real title available?)
• scientific article; zbMATH DE number 1839477 (Why is no real title available?)
• scientific article; zbMATH DE number 786134 (Why is no real title available?)
• scientific article; zbMATH DE number 851453 (Why is no real title available?)
• About the upper chromatic number of a co-hypergraph
• About uniquely colorable mixed hypertrees
• Bicoloring Steiner triple systems
• Coloring mixed hypergraphs: theory, algorithms and applications
• Colouring planar mixed hypergraphs
• Gaps in the chromatic spectrum of face-constrained plane graphs
• Graph Classes: A Survey
• Mixed hypergraphs with bounded degree: Edge-coloring of mixed multigraphs.
• Mixed interval hypergraphs
• Monochromatic vs multicolored paths
• On feasible sets of mixed hypergraphs
• On planar mixed hypergraphs
• Strict colouring for classes of Steiner triple systems
• The chromatic spectrum of mixed hypergraphs
• Towards a Large Set of Steiner Quadruple Systems
• Uncolorable mixed hypergraphs
• Uniquely colorable mixed hypergraphs
• Upper chromatic number of Steiner triple and quadruple systems

Cited in

(16)

• Surjective \texttt{H}-colouring over reflexive digraphs
• A note on mixed tree coloring
• The complexity of surjective homomorphism problems-a survey
• scientific article; zbMATH DE number 1696541 (Why is no real title available?)
• Algebraic global gadgetry for surjective constraint satisfaction
• On the Upper Chromatic Numbers of Mixed Interval Hypertrees
• Voloshin's conjecture for C-perfect hypertrees
• Concepts on coloring of cluster hypergraphs with application
• A note on rainbow-free colorings of uniform hypergraphs
• scientific article; zbMATH DE number 1839477 (Why is no real title available?)
• Mixed hypergraphs with bounded degree: Edge-coloring of mixed multigraphs.
• On feasible sets of mixed hypergraphs
• Mixed hypercacti
• Approximability of the upper chromatic number of hypergraphs
• scientific article; zbMATH DE number 1834670 (Why is no real title available?)
• On rainbow-free colourings of uniform hypergraphs

This page was built for publication: Coloring mixed hypertrees

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