Achromatic number and facial achromatic number of connected locally-connected graphs
From MaRDI portal
Publication:2043353
Recommendations
- scientific article; zbMATH DE number 3851129
- Achromatic numbers of Kneser graphs
- The achromatic number of Kneser graphs
- On the achromatic number of certain distance graphs
- Concerning the achromatic number of graphs
- scientific article; zbMATH DE number 3882457
- scientific article; zbMATH DE number 994578
- scientific article; zbMATH DE number 7491438
- Achromatic numbers for circulant graphs and digraphs
- scientific article; zbMATH DE number 1824689
Cites work
- A new proof of 3-colorability of Eulerian triangulations
- A note on the domination number of triangulations
- Complete colorings of planar graphs
- Dominating sets in planar graphs
- Dominating sets in triangulations on surfaces
- Facial achromatic number of triangulations on the sphere
- Graph colourings and partitions
- Graph theory
- Graphs with homeomorphically irreducible spanning trees
- HISTs of triangulations on surfaces
- Homeomorphically irreducible spanning trees in locally connected graphs
- scientific article; zbMATH DE number 994578 (Why is no real title available?)
- scientific article; zbMATH DE number 1057876 (Why is no real title available?)
- scientific article; zbMATH DE number 1454653 (Why is no real title available?)
- scientific article; zbMATH DE number 3298599 (Why is no real title available?)
- scientific article; zbMATH DE number 3334007 (Why is no real title available?)
- Non-existence of graph embeddings
- On -perfect graphs.
- On certain spanning subgraphs of embeddings with applications to domination
- The achromatic number of a graph
Cited in
(3)
This page was built for publication: Achromatic number and facial achromatic number of connected locally-connected graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2043353)