Exact distance graphs of product graphs

DOI10.1007/s00373-019-02089-0zbMath1431.05050arXiv1810.10198OpenAlexW2971929023MaRDI QIDQ2287747

Nicolas Gastineau, Boštjan Brešar, Olivier Togni, Sandi Klavžar

Publication date: 21 January 2020

Published in: Graphs and Combinatorics (Search for Journal in Brave)

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

zbMATH Keywords

hypercubeconnectivitygraph productgeneralized Johnson graphexact distance graphgeneralized Kneser graph

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Distance in graphs (05C12) Graph operations (line graphs, products, etc.) (05C76)

Related Items (3)

Exact square coloring of subcubic planar graphs ⋮ Exact square coloring of graphs resulting from some graph operations and products ⋮ Injective coloring of graphs revisited

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Sparsity. Graphs, structures, and algorithms
• Kneser's conjecture, chromatic number, and homotopy
• On low tree-depth decompositions
• On the chromatic number of cube-like graphs
• A short proof of Kneser's conjecture
• Near-optimal conflict-free channel set assignments for an optical cluster-based hypercube network
• Chromatic numbers of exact distance graphs
• A combinatorical proof of Kneser's conjecture
• Matroidal bijections between graphs
• On chromatic numbers of close-to-Kneser distance graphs
• On the girth and diameter of generalized Johnson graphs
• Coloring general Kneser graphs and hypergraphs via high-discrepancy hypergraphs
• New results on two hypercube coloring problems
• Self 2-distance Graphs
• The Kronecker Product of Graphs
• Exact Distance Colouring in Trees

This page was built for publication: Exact distance graphs of product graphs