Pages that link to "Item:Q1584287"
From MaRDI portal
The following pages link to Extremal graphs in some coloring problems (Q1584287):
Displaying 20 items.
- Supersaturation problem for color-critical graphs (Q505915) (← links)
- Universal limit theorems in graph coloring problems with connections to extremal combinatorics (Q525299) (← links)
- Graph color extensions: When Hadwiger's conjecture and embeddings help (Q698612) (← links)
- Some colouring problems for Paley graphs (Q817760) (← links)
- Extremal problems on detectable colorings of trees (Q952656) (← links)
- Nordhaus-Gaddum inequalities for the fractional and circular chromatic numbers (Q1025479) (← links)
- On the existence of graphs with prescribed coloring parameters (Q1567294) (← links)
- On Nordhaus-Gaddum type inequalities for the game chromatic and game coloring numbers (Q1732763) (← links)
- A blow-up construction and graph coloring (Q1901028) (← links)
- Extremal triangle-free and odd-cycle-free colourings of uncountable graphs (Q2036604) (← links)
- Extremal graphs for the list-coloring version of a theorem of Nordhaus and Gaddum (Q2741457) (← links)
- On Some Extremal Properties of Hypergraph Colorings (Q3503457) (← links)
- (Q3784094) (← links)
- (Q4347903) (← links)
- The Typical Structure of Gallai Colorings and Their Extremal Graphs (Q5204070) (← links)
- Extremal <i>H</i>‐Colorings of Graphs with Fixed Minimum Degree (Q5251205) (← links)
- To an extremal problem on chromatic numbers of finite graphs (Q5327743) (← links)
- (Q5749309) (← links)
- Graph colourings and partitions (Q5941502) (← links)
- Nordhaus–Gaddum problem in terms of G-free coloring (Q6132869) (← links)
