Pages that link to "Item:Q1633747"
From MaRDI portal
The following pages link to Chromatic numbers of exact distance graphs (Q1633747):
Displayed 10 items.
- Improved bounds for weak coloring numbers (Q2121806) (← links)
- Exact square coloring of certain classes of graphs: complexity and algorithms (Q2172606) (← links)
- On coloring numbers of graph powers (Q2174571) (← links)
- On the weak 2-coloring number of planar graphs (Q2237215) (← links)
- Exact distance graphs of product graphs (Q2287747) (← links)
- Colouring exact distance graphs of chordal graphs (Q2305897) (← links)
- Exact square coloring of subcubic planar graphs (Q2659166) (← links)
- Injective coloring of graphs revisited (Q2689514) (← links)
- 2-distance, injective, and exact square list-coloring of planar graphs with maximum degree 4 (Q6041534) (← links)
- Dimension is polynomial in height for posets with planar cover graphs (Q6187346) (← links)