Dimension, graph and hypergraph coloring
From MaRDI portal
Publication:1590179
DOI10.1023/A:1006429830221zbMATH Open0968.06002MaRDI QIDQ1590179FDOQ1590179
Authors: Stefan Felsner, William T. Trotter 
Publication date: 12 September 2001
Published in: Order (Search for Journal in Brave)
Recommendations
Extremal problems in graph theory (05C35) Coloring of graphs and hypergraphs (05C15) Hypergraphs (05C65) Combinatorics of partially ordered sets (06A07)
Cited In (23)
- Dimension for posets and chromatic number for graphs
- Chromatic numbers of copoint graphs of convex geometries
- The Hardness of Approximating Poset Dimension
- The order dimension of the poset of regions in a hyperplane arrangement.
- Posets with large dimension and relatively few critical pairs
- Forcing posets with large dimension to contain large standard examples
- Planar posets, dimension, breadth and the number of minimal elements
- Block circulant graphs and the graphs of critical pairs of crowns
- Dimensions of hypergraphs
- Dimension and matchings in comparability and incomparability graphs.
- Adjacency posets of planar graphs
- Adjacency posets of outerplanar graphs
- Characterizing graphs of critical pairs of layered generalized crowns
- Title not available (Why is that?)
- The graph of critical pairs of a crown
- Vertex and edge dimension of hypergraphs
- Vertex cover in graphs with locally few colors
- Boxicity of graphs on surfaces
- Boxicity and topological invariants
- On the order dimension of convex geometries
- Boxicity, poset dimension, and excluded minors
- Dimension of posets with planar cover graphs excluding two long incomparable chains
- On the square coloring of comparability graphs
This page was built for publication: Dimension, graph and hypergraph coloring
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1590179)
