Embeddings of a graph into a surface with different weak chromatic numbers
From MaRDI portal
Publication:2657097
DOI10.1007/s00373-020-02256-8zbMath1459.05212OpenAlexW3098179852MaRDI QIDQ2657097
Publication date: 17 March 2021
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00373-020-02256-8
Coloring of graphs and hypergraphs (05C15) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Coloring face hypergraphs on surfaces
- How to determine the maximum genus of a graph
- Maximum face-constrained coloring of plane graphs
- A simple construction for orientable triangular embeddings of the complete graphs on \(12 s\) vertices
- Uniqueness and faithfulness of embedding of toroidal graphs
- Coloring face-hypergraphs of graphs on surfaces
- Tight and untight triangulations of surfaces by complete graphs
- Facially-constrained colorings of plane graphs: a survey
- Looseness ranges of triangulations on closed surfaces
- Coloring Steiner Triple Systems
- Spanning bipartite quadrangulations of even triangulations
This page was built for publication: Embeddings of a graph into a surface with different weak chromatic numbers