scientific article; zbMATH DE number 3717365
From MaRDI portal
Publication:3907606
Cites work
- COVERING AND PACKING IN GRAPHS, I.
- Decomposition of Finite Graphs into Open Chains
- Graphs with forbidden subgraphs
- scientific article; zbMATH DE number 3312524 (Why is no real title available?)
- scientific article; zbMATH DE number 3353324 (Why is no real title available?)
- scientific article; zbMATH DE number 3387385 (Why is no real title available?)
- scientific article; zbMATH DE number 3404271 (Why is no real title available?)
Cited in
(81)- Monochromatic and heterochromatic subgraphs in edge-colored graphs - A survey
- The linear arboricity of graphs
- Some problems about linear arboricity
- Partitioning regular graphs into equicardinal linear forests
- A note on the arboricity of graphs
- Two-coloring the edges of a cubic graph such that each monochromatic component is a path of length at most 5
- Acyclic edge-colorings of sparse graphs
- On the linear k-arboricity of cubic graphs
- Bounded size components -- partitions and transversals.
- Linear \(k\)-arboricities on trees
- Factorisation of regular graphs into forests of short paths
- Trees, paths, stars, caterpillars and spiders
- The star arboricity of graphs
- Partitioning circulant graphs into isomorphic linear forests
- Path covering problems and testing of printed circuits
- The structure of plane graphs with independent crossings and its applications to coloring problems
- Isomorphic bisections of cubic graphs
- Towards the linear arboricity conjecture
- Linear arboricity of outer-1-planar graphs
- The linear arboricity of \(K_5\)-minor free graphs
- Edge coloring of signed graphs
- The list linear arboricity of planar graphs with 7-cycles containing at most two chords
- Linear arboricity of NIC-planar graphs
- Jin Akiyama: a friend and his mathematics (on the occasion of his 60th birthday)
- Recognizing d-interval graphs and d-track interval graphs
- Linear 2-arboricity of planar graphs with neither 3-cycles nor adjacent 4-cycles
- The linear arboricity of planar graphs without 5-, 6-cycles with chords
- An efficient case for computing minimum linear arboricity with small maximum degree
- On the linear arboricity of graphs embeddable in surfaces
- Drawing Graphs on Few Lines and Few Planes
- scientific article; zbMATH DE number 3829954 (Why is no real title available?)
- Trees, Paths, Stars, Caterpillars and Spiders
- The linear arboricity of planar graphs of maximum degree seven is four
- scientific article; zbMATH DE number 3933124 (Why is no real title available?)
- scientific article; zbMATH DE number 3989394 (Why is no real title available?)
- scientific article; zbMATH DE number 4085704 (Why is no real title available?)
- scientific article; zbMATH DE number 3777548 (Why is no real title available?)
- Note on linear arboricity of graphs with large girth
- scientific article; zbMATH DE number 90562 (Why is no real title available?)
- Minimum number of disjoint linear forests covering a planar graph
- scientific article; zbMATH DE number 566421 (Why is no real title available?)
- Edge covering pseudo-outerplanar graphs with forests
- The linear arboricity of planar graphs with maximum degree at least 5
- Drawing graphs on few circles and few spheres
- An introduction to the discharging method via graph coloring
- Packing in regular graphs
- Inapproximability of maximal strip recovery
- An intermediate value theorem for the arboricities
- Graph theory (algorithmic, algebraic, and metric problems)
- On isomorphic linear partitions in cubic graphs
- On isomorphic linear partitions in cubic graphs
- Acyclic chromatic index of chordless graphs
- Combinatorics. Abstracts from the workshop held January 1--7, 2023
- The list linear arboricity of graphs
- On the path partition number of 6‐regular graphs
- Partitioning edges of a planar graph into linear forests and a matching
- Linear arboricity of degenerate graphs
- Orientation‐based edge‐colorings and linear arboricity of multigraphs
- Linear arboricity of 1-planar graphs
- A decomposition method on solving the linear arboricity conjecture
- Linear arboricity of IC-planar graphs
- On the linear arboricity of graphs with treewidth at most four
- On an f-coloring generalization of linear arboricity of multigraphs
- t-linear coloring in graphs with given small lenient-tree-width
- Nearly Hamilton cycles in sublinear expanders and applications
- Towards the linear arboricity conjecture: graph products
- Linear arboricity of the tensor products of complete multipartite graphs
- Comparing the p-independence number of regular graphs to the q-independence number of their line graphs
- On the triple arboricity of graphs
- The linear arboricity of graphs with low treewidth
- Linear arboricity of 1-planar graphs
- Vertex partitioning of graphs into odd induced subgraphs
- The complexity of decomposing a graph into a matching and a bounded linear forest
- Optimal Hamilton covers and linear arboricity for random graphs
- Path odd-covers of graphs
- Path decompositions of oriented graphs
- On linear k-arboricity
- Upper bound for linear arboricity
- Graph factors and factorization: 1985--2003: a survey
- Three ways to cover a graph
- The linear arboricity of planar graphs with no short cycles
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 Q3907606)
