Geometric achromatic and pseudoachromatic indices
From MaRDI portal
Publication:292239
DOI10.1007/s00373-015-1610-xzbMath1339.05105arXiv1303.4673OpenAlexW3098194885MaRDI QIDQ292239
Christian Rubio-Montiel, Jorge Urrutia, Dolores Lara, Thomas Hackl, Natalia Garcia-Colin, Gabriela Araujo-Pardo, Oswin Aichholzer
Publication date: 13 June 2016
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1303.4673
Extremal problems in graph theory (05C35) Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15)
Related Items (3)
Complete colorings of planar graphs ⋮ The achromatic number of Kneser graphs ⋮ Achromatic numbers of Kneser graphs
Cites Work
- Results on the Grundy chromatic number of graphs
- 3-symmetric and 3-decomposable geometric drawings of \(K_n\)
- Graph with given achromatic number
- The complexity of harmonious colouring for trees
- On Conway's thrackle conjecture
- The pseudoachromatic number of a graph
- On the pseudoachromatic index of the complete graph. II
- On the chromatic number of some geometric type Kneser graphs
- On the pseudoachromatic index of the complete graph
- Edge Dominating Sets in Graphs
- Thickness and Antithickness of Graphs
- The Chromatic Number of the Convex Segment Disjointness Graph
- On Sets of Distances of n Points
- Graph colourings and partitions
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Geometric achromatic and pseudoachromatic indices