scientific article; zbMATH DE number 7593849

zbMATH Open1497.05077MaRDI QIDQ5869435FDOQ5869435

Authors: Daniel Delbourgo, Kerri Morgan 

Publication date: 28 September 2022

Full work available at URL: http://ajc.maths.uq.edu.au/pdf/84/ajc_v84_p056.pdf

Title of this publication is not available (Why is that?)

Recommendations

• On the chromatic number of rational five-space
• scientific article; zbMATH DE number 4065017
• The chromatic number of 5-valent circulants
• A five-color theorem
• A new bound for the chromatic number of the rational five-space
• The chromaticity of certain graphs with five triangles
• On the chromatic number of a random 5-regular graph
• scientific article; zbMATH DE number 4110895
• scientific article; zbMATH DE number 4008419
• scientific article; zbMATH DE number 3920500

zbMATH Keywords

block-counting processpurification process

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Cites Work

• The Zero-Free Intervals for Chromatic Polynomials of Graphs
• An introduction to chromatic polynomials
• Chromatic Roots are Dense in the Whole Complex Plane
• Benjamini-Schramm convergence and the distribution of chromatic roots for sparse graphs
• Chromatic Polynomials
• Planar triangulations with real chromatic roots arbitrarily close to 4
• Algebraic properties of chromatic roots
• On chromatic coefficients
• A little statistical mechanics for the graph theorist
• Title not available (Why is that?)
• Zeros of chromatic and flow polynomials of graphs
• Density of Chromatic Roots in Minor-Closed Graph Families
• Chromatic polynomials of complements of bipartite graphs
• An algorithm which outputs a graph with a specified chromatic factor

Cited In (3)

• Title not available (Why is that?)
• Title not available (Why is that?)
• The hunting of a snark with total chromatic number 5

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5869435)