scientific article; zbMATH DE number 866055

MaRDI QIDQ4873220zbMATH OpenFDO

Authors T. R. Jensen, Bjarne Toft

Publication date 28 May 1996

zbMATH Keywords

choice numberchromatic numberEuclidean distancegraph parameterslist chromatic numberplane unit-distance graphvertex colouring

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Recommendations

• scientific article; zbMATH DE number 866028
• Circular Coloring the Plane
• scientific article; zbMATH DE number 1552837
• scientific article; zbMATH DE number 2068164
• List colourings of planar graphs

Cited in

(16)

• On the neighbour sum distinguishing index of graphs with bounded maximum average degree
• Partitioning sparse graphs into an independent set and a forest of bounded degree
• A Brooks type theorem for the maximum local edge connectivity
• L(p,q)-labeling of sparse graphs
• Coloring squares of graphs with mad constraints
• On the total neighbour sum distinguishing index of graphs with bounded maximum average degree
• Incidence coloring of graphs with high maximum average degree
• QUBO formulations of the longest path problem
• Semialgebraic graphs having countable list-chromatic numbers
• Vertex partitions of graphs into cographs and stars
• Vizing's coloring algorithm and the fan number
• Hypergraph list coloring and Euclidean Ramsey theory
• scientific article; zbMATH DE number 866028 (Why is no real title available?)
• On weight choosabilities of graphs with bounded maximum average degree
• Homomorphisms from sparse graphs to the Petersen graph
• Decomposing a graph into forests

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 Q4873220)