scientific article; zbMATH DE number 7124244

zbMath1425.05057MaRDI QIDQ5241089

Haylee Harris

Publication date: 30 October 2019

Full work available at URL: https://journals.calstate.edu/pump/article/view/1448

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

complete graphscoloring graphtransitive graphs

Mathematics Subject Classification ID

Association schemes, strongly regular graphs (05E30) Coloring of graphs and hypergraphs (05C15) Distance in graphs (05C12)

Cites Work

• Unnamed Item
• Unnamed Item
• Classifying coloring graphs
• Forbidden subgraphs of coloring graphs
• Cut-colorings in coloring graphs
• Connectedness of the graph of vertex-colourings
• The canonical coloring graph of trees and cycles
• Randomly coloring sparse random graphs with fewer colors than the maximum degree
• On chromatic number of graphs and set-systems

This page was built for publication: