Pages that link to "Item:Q485549"
From MaRDI portal
The following pages link to Chromatic number and complete graph substructures for degree sequences (Q485549):
Displaying 5 items.
- On the sum necessary to ensure that a degree sequence is potentially \(H\)-graphic (Q524192) (← links)
- A degree sequence variant of graph Ramsey numbers (Q742597) (← links)
- A new lower bound on the potential-Ramsey number of two graphs (Q2025212) (← links)
- Hadwiger's conjecture for degree sequences (Q2349516) (← links)
- Extremal values of the chromatic number for a given degree sequence (Q2409517) (← links)
