The following pages link to Colouring a graph frugally (Q1280272):
Displaying 16 items.
- Linear coloring of planar graphs without 4-cycles (Q354457) (← links)
- On linear coloring of planar graphs with small girth (Q400495) (← links)
- Improved bounds on coloring of graphs (Q412254) (← links)
- A result on linear coloring of planar graphs (Q456164) (← links)
- Improved bounds on linear coloring of plane graphs (Q625757) (← links)
- Upper bounds on the linear chromatic number of a graph (Q626759) (← links)
- \(k\)-forested coloring of planar graphs with large girth (Q632996) (← links)
- Frugal, acyclic and star colourings of graphs (Q643020) (← links)
- Linear and 2-frugal choosability of graphs of small maximum average degree (Q659749) (← links)
- \(k\)-forested choosability of planar graphs and sparse graphs (Q764887) (← links)
- Linear choosability of graphs (Q932648) (← links)
- Asymptotically optimal frugal colouring (Q965250) (← links)
- Graph coloring with cardinality constraints on the neighborhoods (Q1040081) (← links)
- Linear coloring of planar graphs with large girth (Q1045057) (← links)
- Star Chromatic Index (Q4916092) (← links)
- Better bounds for poset dimension and boxicity (Q5217895) (← links)
