The following pages link to (Q5536129):
Displaying 23 items.
- A lower bound for the chromatic capacity in terms of the chromatic number of a graph (Q390289) (← links)
- The chromatic gap and its extremes (Q713979) (← links)
- On coloring graphs with locally small chromatic number (Q759761) (← links)
- On the existence of two non-neighboring subgraphs in a graph (Q1078191) (← links)
- The average size of an independent set in graphs with a given chromatic number (Q1081615) (← links)
- On complete subgraphs of \(r\)-chromatic graphs (Q1217812) (← links)
- Chromatic partitions of a graph (Q1263595) (← links)
- Graph coloring and Graham's greatest common divisor problem (Q1690244) (← links)
- Graph imperfection. II (Q1850632) (← links)
- Inverting the Turán problem with chromatic number (Q2037594) (← links)
- Chromatic number, clique subdivisions, and the conjectures of Hajós and Erdős-Fajtlowicz (Q2448966) (← links)
- Almost all graphs with high girth and suitable density have high chromatic number (Q2746204) (← links)
- Graph Theory and Probability (Q3253064) (← links)
- Problems and results on chromatic numbers in finite and infinite graphs (Q3691755) (← links)
- On circuits and subgraphs of chromatic graphs (Q3845890) (← links)
- On graphs of Ramsey type (Q4100121) (← links)
- (Q4558664) (← links)
- Improved approximations of independent sets in bounded-degree graphs (Q5054761) (← links)
- Approximating maximum independent sets by excluding subgraphs (Q5056088) (← links)
- The $\chi$-Ramsey Problem for Triangle-Free Graphs (Q5074951) (← links)
- Some Conjectures and Questions in Chromatic Topological Graph Theory (Q5506783) (← links)
- Problems and results in chromatic graph theory (Q5589869) (← links)
- Extended Keller graph and its properties (Q5742571) (← links)
