scientific article; zbMATH DE number 1299961
From MaRDI portal
Publication:4248536
DOI10.1002/(SICI)1097-0118(199906)31:2%3C129::AID-JGT5%3E3.0.CO;2-AzbMATH Open0933.05056MaRDI QIDQ4248536FDOQ4248536
Authors: Jian-Liang Wu
Publication date: 29 September 1999
Title of this publication is not available (Why is that?)
Recommendations
Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15) Paths and cycles (05C38)
Cites Work
Cited In (39)
- On linear 2-arboricity of certain graphs
- Title not available (Why is that?)
- Minimum number of disjoint linear forests covering a planar graph
- On the linear arboricity of graphs with treewidth at most four
- A decomposition method on solving the linear arboricity conjecture
- Linear 2-arboricity of planar graphs with neither 3-cycles nor adjacent 4-cycles
- Partitioning edges of a planar graph into linear forests and a matching
- Linear arboricity of 1-planar graphs
- Edge covering pseudo-outerplanar graphs with forests
- On the linear arboricity of graphs embeddable in surfaces
- Edge coloring of signed graphs
- The linear arboricity of planar graphs with no short cycles
- On point-linear arboricity of planar graphs
- Linear arboricity of NIC-planar graphs
- Some results on linear arboricity
- The conjunction of the linear arboricity conjecture and Lovász's path partition theorem
- Linear arboricity of IC-planar graphs
- Decomposing planar graphs into graphs with degree restrictions
- On an \(f\)-coloring generalization of linear arboricity of multigraphs
- Linear arboricity of outer-1-planar graphs
- The linear arboricity of planar graphs with maximum degree at least 5
- Jin Akiyama: a friend and his mathematics (on the occasion of his 60th birthday)
- Towards the linear arboricity conjecture
- The list linear arboricity of graphs
- The structure of plane graphs with independent crossings and its applications to coloring problems
- The list linear arboricity of planar graphs with 7-cycles containing at most two chords
- Linear arboricity of degenerate graphs
- Three ways to cover a graph
- On the linear vertex-arboricity of a planar graph
- Title not available (Why is that?)
- The Linear Arboricity of Graphs on Surfaces of Negative Euler Characteristic
- The linear arboricity of planar graphs of maximum degree seven is four
- Graph factors and factorization: 1985--2003: a survey
- A structural theorem for planar graphs with some applications
- The linear arboricity of \(K_5\)-minor free graphs
- An efficient case for computing minimum linear arboricity with small maximum degree
- An introduction to the discharging method via graph coloring
- The linear arboricity of planar graphs without 5-, 6-cycles with chords
- The linear 6-arboricity of the complete bipartite graph \(K_{m,n}\)
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4248536)