Perfect colorings of regular graphs

DOI10.1090/conm/764/15356zbMath1468.05071arXiv1804.03552OpenAlexW3145574991MaRDI QIDQ4998739

Dirk Frettlöh, Joseph Ray Clarence G. Damasco

Publication date: 9 July 2021

Published in: Polytopes and Discrete Geometry (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Coloring of graphs and hypergraphs (05C15)

Uses Software

• SageMath

Cites Work

• Equitable decompositions of graphs with symmetries
• On calculation of the interweight distribution of an equitable partition
• On the regularity of perfect 2-colorings of the Johnson graph
• Bounding the diameter of distance. Regular graphs
• Boolean degree 1 functions on some classical association schemes
• On Perfect 2‐Colorings of Johnson Graphs J(v, 3)
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Perfect colorings of regular graphs