Embeddings of a graph into a surface with different weak chromatic numbers
From MaRDI portal
Publication:2657097
Recommendations
Cites work
- scientific article; zbMATH DE number 4006288 (Why is no real title available?)
- scientific article; zbMATH DE number 3450230 (Why is no real title available?)
- A simple construction for orientable triangular embeddings of the complete graphs on 12 s vertices
- Coloring Steiner Triple Systems
- Coloring face hypergraphs on surfaces
- Coloring face-hypergraphs of graphs on surfaces
- Facially-constrained colorings of plane graphs: a survey
- Graphs on surfaces
- How to determine the maximum genus of a graph
- Looseness ranges of triangulations on closed surfaces
- Maximum face-constrained coloring of plane graphs
- Spanning bipartite quadrangulations of even triangulations
- Tight and untight triangulations of surfaces by complete graphs
- Uniqueness and faithfulness of embedding of toroidal graphs
Cited in
(3)
This page was built for publication: Embeddings of a graph into a surface with different weak chromatic numbers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2657097)