Pages that link to "Item:Q1121899"
From MaRDI portal
The following pages link to On constructive methods in the theory of colour-critical graphs (Q1121899):
Displaying 16 items.
- Critically paintable, choosable or colorable graphs (Q713164) (← links)
- On a conjecture of Gallai concerning complete subgraphs of \(k\)-critical graphs (Q1198644) (← links)
- On the minimal number of edges in color-critical graphs (Q1272188) (← links)
- On extensions of a conjecture of Gallai (Q1362102) (← links)
- Problems and results in extremal combinatorics. I. (Q1417566) (← links)
- Generalizations of independence and chromatic numbers of a graph (Q1801703) (← links)
- 4-chromatic graphs with large odd girth (Q1842185) (← links)
- Some remarks on \((k-1)\)-critical subgraphs of \(k\)-critical graphs (Q1906843) (← links)
- \(S\)-packing chromatic vertex-critical graphs (Q2197411) (← links)
- Generalised Mycielski graphs and the Borsuk-Ulam theorem (Q2327221) (← links)
- Questions on color-critical subgraphs (Q2657088) (← links)
- Edge-critical subgraphs of Schrijver graphs. II: The general case (Q2664563) (← links)
- Small odd cycles in 4-chromatic graphs (Q2744571) (← links)
- Embedding Graphs into Larger Graphs: Results, Methods, and Problems (Q3295275) (← links)
- On graphs with strongly independent color-classes (Q4736765) (← links)
- A note on the immersion number of generalized Mycielski graphs (Q6616828) (← links)
