Embeddings of a graph into a surface with different weak chromatic numbers
From MaRDI portal
Publication:2657097
DOI10.1007/S00373-020-02256-8zbMATH Open1459.05212OpenAlexW3098179852MaRDI QIDQ2657097FDOQ2657097
Authors: Kengo Enami, Kenta Noguchi
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
Recommendations
Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Coloring of graphs and hypergraphs (05C15)
Cites Work
- Graphs on surfaces
- Title not available (Why is that?)
- Title not available (Why is that?)
- Maximum face-constrained coloring of plane graphs
- Tight and untight triangulations of surfaces by complete graphs
- Looseness ranges of triangulations on closed surfaces
- How to determine the maximum genus of a graph
- Uniqueness and faithfulness of embedding of toroidal graphs
- Coloring Steiner Triple Systems
- Coloring face-hypergraphs of graphs on surfaces
- Coloring face hypergraphs on surfaces
- Facially-constrained colorings of plane graphs: a survey
- A simple construction for orientable triangular embeddings of the complete graphs on \(12 s\) vertices
- Spanning bipartite quadrangulations of even triangulations
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)