Colouring exact distance graphs of chordal graphs

DOI10.1016/j.disc.2019.111769zbMath1435.05085arXiv1703.07008OpenAlexW2997738535MaRDI QIDQ2305897

Daniel A. Quiroz

Publication date: 20 March 2020

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1703.07008

zbMATH Keywords

chordal graphgenustree-widthisometric subgraphexact distance graphadjacent-cliques graph

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Distance in graphs (05C12) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Related Items (4)

Integral-root polynomials and chromatic uniqueness of graphs ⋮ Exact square coloring of subcubic planar graphs ⋮ Exact square coloring of certain classes of graphs: complexity and algorithms ⋮ 2-distance, injective, and exact square list-coloring of planar graphs with maximum degree 4

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Induced subgraphs of graphs with large chromatic number. I. Odd holes
• Sparsity. Graphs, structures, and algorithms
• The strong chromatic index of sparse graphs
• On rigid circuit graphs
• On low tree-depth decompositions
• Nonrepetitive colorings of graphs of bounded tree-width
• Embedding graphs as isometric medians
• Chromatic numbers of exact distance graphs
• Incidence matrices and interval graphs
• Coloring Powers of Planar Graphs
• Exact Distance Colouring in Trees
• Coloring Powers of Chordal Graphs

This page was built for publication: Colouring exact distance graphs of chordal graphs