The following pages link to (Q3907606):
Displaying 50 items.
- Minimum number of disjoint linear forests covering a planar graph (Q405685) (← links)
- Edge covering pseudo-outerplanar graphs with forests (Q449118) (← links)
- The linear arboricity of planar graphs with maximum degree at least 5 (Q456114) (← links)
- An introduction to the discharging method via graph coloring (Q507506) (← links)
- Inapproximability of maximal strip recovery (Q551208) (← links)
- An intermediate value theorem for the arboricities (Q554848) (← links)
- Graph theory (algorithmic, algebraic, and metric problems) (Q581419) (← links)
- On linear k-arboricity (Q761470) (← links)
- Upper bound for linear arboricity (Q809087) (← links)
- Graph factors and factorization: 1985--2003: a survey (Q868347) (← links)
- Three ways to cover a graph (Q898135) (← links)
- The linear arboricity of planar graphs with no short cycles (Q995578) (← links)
- Monochromatic and heterochromatic subgraphs in edge-colored graphs - A survey (Q1014813) (← links)
- The linear arboricity of graphs (Q1120581) (← links)
- Some problems about linear arboricity (Q1164649) (← links)
- Partitioning regular graphs into equicardinal linear forests (Q1174174) (← links)
- A note on the arboricity of graphs (Q1205341) (← links)
- Two-coloring the edges of a cubic graph such that each monochromatic component is a path of length at most 5 (Q1306426) (← links)
- Acyclic edge-colorings of sparse graphs (Q1324448) (← links)
- On the linear \(k\)-arboricity of cubic graphs (Q1356680) (← links)
- Bounded size components -- partitions and transversals. (Q1400964) (← links)
- Linear \(k\)-arboricities on trees (Q1570841) (← links)
- Factorisation of regular graphs into forests of short paths (Q1584284) (← links)
- Trees, paths, stars, caterpillars and spiders (Q1635718) (← links)
- The star arboricity of graphs (Q1825208) (← links)
- Partitioning circulant graphs into isomorphic linear forests (Q1864211) (← links)
- Path covering problems and testing of printed circuits (Q1900134) (← links)
- The structure of plane graphs with independent crossings and its applications to coloring problems (Q1935605) (← links)
- Isomorphic bisections of cubic graphs (Q1984530) (← links)
- Towards the linear arboricity conjecture (Q1985445) (← links)
- Linear arboricity of outer-1-planar graphs (Q2033994) (← links)
- The linear arboricity of \(K_5\)-minor free graphs (Q2081465) (← links)
- Edge coloring of signed graphs (Q2185748) (← links)
- The list linear arboricity of planar graphs with 7-cycles containing at most two chords (Q2286100) (← links)
- Linear arboricity of NIC-planar graphs (Q2300535) (← links)
- Jin Akiyama: a friend and his mathematics (on the occasion of his 60th birthday) (Q2373936) (← links)
- Recognizing \(d\)-interval graphs and \(d\)-track interval graphs (Q2375953) (← links)
- Linear 2-arboricity of planar graphs with neither 3-cycles nor adjacent 4-cycles (Q2376098) (← links)
- The linear arboricity of planar graphs without 5-, 6-cycles with chords (Q2376109) (← links)
- An efficient case for computing minimum linear arboricity with small maximum degree (Q2414123) (← links)
- On the linear arboricity of graphs embeddable in surfaces (Q2448856) (← links)
- A planar linear arboricity conjecture (Q2891050) (← links)
- Drawing Graphs on Few Lines and Few Planes (Q2961513) (← links)
- (Q3037472) (← links)
- Trees, Paths, Stars, Caterpillars and Spiders (Q3467870) (← links)
- The linear arboricity of planar graphs of maximum degree seven is four (Q3522847) (← links)
- (Q3708055) (← links)
- (Q3752419) (← links)
- (Q3815343) (← links)
- (Q3956983) (← links)
