The following pages link to Colouring a graph frugally (Q1280272):
Displaying 33 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)
- Linear coloring of graphs (Q1584255) (← links)
- New upper bounds on linear coloring of planar graphs (Q1757984) (← links)
- The linear \(t\)-colorings of Sierpiński-like graphs (Q2014728) (← links)
- The complexity of frugal colouring (Q2023759) (← links)
- Intersection dimension and graph invariants (Q2214313) (← links)
- Dynamic proper colorings of a graph (Q2256703) (← links)
- Linear choosability of sparse graphs (Q2275448) (← links)
- The \((d, 1)\)-total labelling of Sierpiński-like graphs (Q2279623) (← links)
- Linear colorings of subcubic graphs (Q2444734) (← links)
- Bounds on vertex colorings with restrictions on the union of color classes (Q3083409) (← links)
- Nondegenerate colourings in the Brooks theorem (Q3225894) (← links)
- Conflict-Free Colourings of Graphs and Hypergraphs (Q3552506) (← links)
- Coloring nonuniform hypergraphs: A new algorithmic approach to the general Lov�sz local lemma (Q4521547) (← links)
- Star Chromatic Index (Q4916092) (← links)
- Separation dimension and degree (Q4958696) (← links)
- A General Framework for Hypergraph Coloring (Q5093586) (← links)
- Complexity Dichotomy for List-5-Coloring with a Forbidden Induced Subgraph (Q5099103) (← links)
- Better bounds for poset dimension and boxicity (Q5217895) (← links)
- Distributed algorithms for the Lovász local lemma and graph coloring (Q5920074) (← links)
