Coloring mixed hypertrees
DOI10.1016/J.DAM.2005.05.019zbMATH Open1088.05031DBLPjournals/dam/KralKPV06OpenAlexW2007023458WikidataQ57601527 ScholiaQ57601527MaRDI QIDQ2489959FDOQ2489959
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
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
Graph theory (including graph drawing) in computer science (68R10) Coloring of graphs and hypergraphs (05C15) Hypergraphs (05C65)
Cites Work
- Title not available (Why is that?)
- Graph Classes: A Survey
- Title not available (Why is that?)
- The chromatic spectrum of mixed hypergraphs
- Coloring mixed hypergraphs: theory, algorithms and applications
- On feasible sets of mixed hypergraphs
- Mixed interval hypergraphs
- Colouring planar mixed hypergraphs
- Uncolorable mixed hypergraphs
- Mixed hypergraphs with bounded degree: Edge-coloring of mixed multigraphs.
- Title not available (Why is that?)
- Bicoloring Steiner triple systems
- On planar mixed hypergraphs
- Upper chromatic number of Steiner triple and quadruple systems
- Strict colouring for classes of Steiner triple systems
- About the upper chromatic number of a co-hypergraph
- Title not available (Why is that?)
- Gaps in the chromatic spectrum of face-constrained plane graphs
- Title not available (Why is that?)
- Towards a Large Set of Steiner Quadruple Systems
- Title not available (Why is that?)
- Uniquely colorable mixed hypergraphs
- About uniquely colorable mixed hypertrees
- Monochromatic vs multicolored paths
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (16)
- Surjective \texttt{H}-colouring over reflexive digraphs
- A note on mixed tree coloring
- The complexity of surjective homomorphism problems-a survey
- Algebraic global gadgetry for surjective constraint satisfaction
- Title not available (Why is that?)
- 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
- Title not available (Why is that?)
- Mixed hypergraphs with bounded degree: Edge-coloring of mixed multigraphs.
- On feasible sets of mixed hypergraphs
- Mixed hypercacti
- Title not available (Why is that?)
- Approximability of the upper chromatic number of hypergraphs
- 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)
