Some generalizations of theorems on vertex coloring
From MaRDI portal
(Redirected from Publication:855855)
Recommendations
Cites work
- scientific article; zbMATH DE number 3264781 (Why is no real title available?)
- scientific article; zbMATH DE number 3043302 (Why is no real title available?)
- scientific article; zbMATH DE number 3068973 (Why is no real title available?)
- A Property of 4-Chromatic Graphs and some Remarks on Critical Graphs
- An inequality for the chromatic number of a graph
Cited in
(7)- The vertex coloring problem and its generalizations
- On the connection between the chromatic number of a graph and the number of cycles covering a vertex or an edge
- An Erdős-Gallai type theorem for vertex colored graphs
- Lax pair formulation in the simultaneous presence of boundaries and defects
- On a generalization of the Gallai-Roy-Vitaver theorem to the bandwidth coloring problem
- scientific article; zbMATH DE number 4010540 (Why is no real title available?)
- Revisiting a theorem by Folkman on graph colouring
This page was built for publication: Some generalizations of theorems on vertex coloring
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q855855)