Pages that link to "Item:Q4156455"
From MaRDI portal
The following pages link to An acyclic analogue to Heawood's theorem (Q4156455):
Displaying 6 items.
- Graph theory (algorithmic, algebraic, and metric problems) (Q581419) (← links)
- Adjacency posets of planar graphs (Q966048) (← links)
- A bound for the game chromatic number of graphs (Q1297403) (← links)
- The game coloring number of planar graphs (Q1305532) (← links)
- On acyclic colorings of graphs on surfaces (Q1916898) (← links)
- Hardness transitions and uniqueness of acyclic colouring (Q6145810) (← links)
