Colouring planar mixed hypergraphs

zbMATH Open0978.05027MaRDI QIDQ1591737

Eric Mendelsohn, André Kündgen, Vitaly Voloshin

Publication date: 9 January 2001

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

Full work available at URL: https://eudml.org/doc/121523

File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

zbMATH Keywords

chromatic spectrummixed hypergraphsplanar graphs and hypergraphscolourabilitycolourings of hypergraphs

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items (21)

On perfection and imperfection of one-realizations of a given set ⋮ More result on the smallest one-realization of a given set ⋮ Mixed hypergraphs and other coloring problems ⋮ Facially-constrained colorings of plane graphs: a survey ⋮ Title not available (Why is that?) ⋮ The \(k\)-annihilating-ideal hypergraph of commutative ring ⋮ The smallest uniform color-bounded hypergraphs which are one-realizations of a given set ⋮ Non-monochromatic non-rainbow colourings of \(\sigma\)-hypergraphs ⋮ On the structure of uniform one-realizations of a given set ⋮ More results on the smallest one-realization of a given set. II ⋮ On maximum face-constrained coloring of plane graphs with no short face cycles. ⋮ Looseness of plane graphs ⋮ WORM colorings of planar graphs ⋮ Complexity of two coloring problems in cubic planar bipartite mixed graphs ⋮ Coloring face hypergraphs on surfaces ⋮ Coloring mixed hypertrees ⋮ On planar mixed hypergraphs ⋮ The smallest one-realization of a given set. IV ⋮ The smallest one-realization of a given set. III ⋮ Coloring face-hypergraphs of graphs on surfaces ⋮ Title not available (Why is that?)

This page was built for publication: Colouring planar mixed hypergraphs

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