Colouring planar mixed hypergraphs
From MaRDI portal
Publication:1591737
zbMATH Open0978.05027MaRDI QIDQ1591737FDOQ1591737
V. I. Voloshin, Eric Mendelsohn, André Kündgen
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.)
chromatic spectrummixed hypergraphscolourabilitycolourings of hypergraphsplanar graphs and hypergraphs
Cited In (22)
- On planar mixed hypergraphs
- Coloring face hypergraphs on surfaces
- Title not available (Why is that?)
- On planar mixed hypergraphs
- On perfection and imperfection of one-realizations of a given set
- More result on the smallest one-realization of a given set
- On maximum face-constrained coloring of plane graphs with no short face cycles.
- The smallest one-realization of a given set. III
- Mixed hypergraphs and other coloring problems
- Coloring face-hypergraphs of graphs on surfaces
- Facially-constrained colorings of plane graphs: a survey
- 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
- The \(k\)-annihilating-ideal hypergraph of commutative ring
- The smallest uniform color-bounded hypergraphs which are one-realizations of a given set
- The smallest one-realization of a given set. IV
- Coloring mixed hypertrees
- Complexity of two coloring problems in cubic planar bipartite mixed graphs
- Looseness of plane graphs
- WORM colorings of planar graphs
- Title not available (Why is that?)
Recommendations
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)
