Some colouring problems for Paley graphs

DOI10.1016/j.disc.2005.10.018zbMath1085.05031OpenAlexW1967020912MaRDI QIDQ817760

E. Maistrelli, David B. Penman

Publication date: 20 March 2006

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

Full work available at URL: https://doi.org/10.1016/j.disc.2005.10.018

zbMATH Keywords

pseudo-random graphgraph colourings

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items

Gauss sums and the maximum cliques in generalized Paley graphs of square order, Multicolor Ramsey Numbers For Complete Bipartite Versus Complete Graphs, On the independence ratio of distance graphs, Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Graphical properties related to minimal imperfection
• Maximal cliques in the Paley graph of square order
• The star arboricity of graphs
• The list chromatic index of a bipartite multigraph
• Total colourings of graphs
• List coloring of random and pseudo-random graphs
• On total colourings of graphs
• THE CLIQUE NUMBERS AND CHROMATIC NUMBERS OF CERTAIN PALEY GRAPHS
• An upper bound for the total chromatic number of dense graphs
• New Bounds on the List-Chromatic Index of the Complete Graph and Other Simple Graphs
• Graphs of degree 4 are 5-edge-choosable
• Paths in graphs
• On the adjacency properties of paley graphs