The following pages link to Linear coloring of graphs (Q1584255):
Displaying 30 items.
- Linear coloring of planar graphs without 4-cycles (Q354457) (← links)
- On linear coloring of planar graphs with small girth (Q400495) (← links)
- Linear coloring of sparse graphs (Q412383) (← 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)
- Graph coloring in linear time (Q921012) (← links)
- Linear choosability of graphs (Q932648) (← links)
- Asymptotically optimal frugal colouring (Q965250) (← links)
- Linear coloring of graphs embeddable in a surface of nonnegative characteristic (Q1041551) (← links)
- Linear coloring of planar graphs with large girth (Q1045057) (← links)
- The chromatic number of graphs which induce neither \(K_{1,3}\) nor \(K_ 5-e\) (Q1078192) (← links)
- Legal coloring of graphs (Q1079578) (← links)
- New upper bounds on linear coloring of planar graphs (Q1757984) (← links)
- \(\mathcal Q\)-Ramsey classes of graphs (Q1761462) (← links)
- The linear \(t\)-colorings of Sierpiński-like graphs (Q2014728) (← links)
- Entropy compression versus Lovász local lemma (Q2020021) (← links)
- Linear list coloring of some sparse graphs (Q2214305) (← links)
- Linear choosability of sparse graphs (Q2275448) (← links)
- Linear colorings of simplicial complexes and collapsing (Q2384574) (← links)
- Linear colorings of subcubic graphs (Q2444734) (← links)
- Acyclic colouring of some line graphs (Q2844386) (← links)
- Graph theoretic algorithm for automatic operation sequencing for progressive die design (Q3498881) (← links)
- Linear list r-hued coloring of sparse graphs (Q4577851) (← links)
- Linear colouring of binomial random graphs (Q6646401) (← links)
- Proper conflict-free coloring of graphs with large maximum degree (Q6654118) (← links)
