On planar mixed hypergraphs

zbMath1021.05032MaRDI QIDQ5948492

Daniel Král', Zdeněk Dvořák

Publication date: 11 December 2001

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: http://www.emis.de/journals/EJC/Volume_8/Abstracts/v8i1r35.html

zbMATH Keywords

complexitymixed hypergraphscoloring hypergraphsplanar hypergraphs

Mathematics Subject Classification ID

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

Related Items (7)

Facially-constrained colorings of plane graphs: a survey ⋮ Non-monochromatic non-rainbow colourings of \(\sigma\)-hypergraphs ⋮ On maximum face-constrained coloring of plane graphs with no short face cycles. ⋮ WORM colorings of planar graphs ⋮ Coloring face hypergraphs on surfaces ⋮ Coloring mixed hypertrees ⋮ Chords of 2-factors in planar cubic bridgeless graphs

This page was built for publication: On planar mixed hypergraphs