Achromatic number and facial achromatic number of connected locally-connected graphs
From MaRDI portal
Publication:2043353
DOI10.1016/j.dam.2021.05.024zbMath1469.05058OpenAlexW3172363166MaRDI QIDQ2043353
Publication date: 2 August 2021
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2021.05.024
Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15) Connectivity (05C40)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On certain spanning subgraphs of embeddings with applications to domination
- Complete colorings of planar graphs
- Dominating sets in planar graphs
- Facial achromatic number of triangulations on the sphere
- HISTs of triangulations on surfaces
- Graph Theory
- Homeomorphically Irreducible Spanning Trees in Locally Connected Graphs
- A new proof of 3-colorability of Eulerian triangulations
- Non-existence of graph embeddings
- On $\omega \psi$-Perfect Graphs
- Graphs with homeomorphically irreducible spanning trees
- Dominating sets in triangulations on surfaces
- A Note on the Domination Number of Triangulations
- The achromatic number of a graph
- Graph colourings and partitions
This page was built for publication: Achromatic number and facial achromatic number of connected locally-connected graphs