scientific article; zbMATH DE number 3251276
From MaRDI portal
Publication:5536129
Recommendations
- scientific article; zbMATH DE number 773170
- scientific article; zbMATH DE number 4099332
- A note on the chromatic number of a graph
- Note on $k$-chromatic graphs
- scientific article; zbMATH DE number 3245178
- scientific article; zbMATH DE number 3851122
- scientific article; zbMATH DE number 4035863
- A note on total chromatic numbers of graphs
- On chromaticity of graphs
- scientific article; zbMATH DE number 742642
Cited in
(26)- Improved approximations of independent sets in bounded-degree graphs
- scientific article; zbMATH DE number 3520447 (Why is no real title available?)
- scientific article; zbMATH DE number 3882454 (Why is no real title available?)
- Almost all graphs with high girth and suitable density have high chromatic number
- scientific article; zbMATH DE number 1052839 (Why is no real title available?)
- Approximating maximum independent sets by excluding subgraphs
- On coloring graphs with locally small chromatic number
- The \(\chi\)-Ramsey problem for triangle-free graphs
- On the existence of two non-neighboring subgraphs in a graph
- scientific article; zbMATH DE number 3914342 (Why is no real title available?)
- scientific article; zbMATH DE number 4108789 (Why is no real title available?)
- scientific article; zbMATH DE number 3308988 (Why is no real title available?)
- Some Conjectures and Questions in Chromatic Topological Graph Theory
- The chromatic gap and its extremes
- Graph imperfection. II
- Inverting the Turán problem with chromatic number
- Graph Theory and Probability
- Extended Keller graph and its properties
- Chromatic number, clique subdivisions, and the conjectures of Hajós and Erdős-Fajtlowicz
- Graph coloring and Graham's greatest common divisor problem
- scientific article; zbMATH DE number 6986950 (Why is no real title available?)
- On complete subgraphs of r-chromatic graphs
- On circuits and subgraphs of chromatic graphs
- The average size of an independent set in graphs with a given chromatic number
- A lower bound for the chromatic capacity in terms of the chromatic number of a graph
- Chromatic partitions of a graph
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 Q5536129)
