The following pages link to Path chromatic numbers of graphs (Q4206745):
Displaying 18 items.
- The vertex linear arboricity of distance graphs (Q819822) (← links)
- Maximum induced forests of planar graphs (Q1107540) (← links)
- Relaxed chromatic numbers of graphs (Q1323496) (← links)
- Path choosability of planar graphs (Q1627209) (← links)
- On monochromatic component size for improper colourings (Q1775062) (← links)
- On the chromatic index of path decompositions (Q1876679) (← links)
- Paths with two blocks in \(k\)-chromatic digraphs (Q1886358) (← links)
- Computational complexity of \((2,2)\) path chromatic number problem (Q1891685) (← links)
- On path-chromatically unique graphs (Q1916374) (← links)
- Locating chromatic number of powers of paths and cycles (Q2335071) (← links)
- Jin Akiyama: a friend and his mathematics (on the occasion of his 60th birthday) (Q2373936) (← links)
- Drawing Graphs on Few Lines and Few Planes (Q2961513) (← links)
- On vertex partitions and some minor-monotone graph parameters (Q3067061) (← links)
- On the linear vertex-arboricity of a planar graph (Q3484846) (← links)
- (Q3984228) (← links)
- (Q4255999) (← links)
- (Q4294602) (← links)
- Splitting Planar Graphs of Girth 6 into Two Linear Forests with Short Paths (Q4978291) (← links)