scientific article
From MaRDI portal
Publication:3907606
zbMath0458.05050MaRDI QIDQ3907606
Jin Akiyama, Geoffrey Exoo, Frank Harary
Publication date: 1980
Full work available at URL: https://eudml.org/doc/34095
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
complete graphscomplete bipartite graphscyclicityline graphspath numberpoint anarboricitypoint linear arboricity
Related Items
Unnamed Item, A Planar linear arboricity conjecture, 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, Trees, paths, stars, caterpillars and spiders, On the linear \(k\)-arboricity of cubic graphs, Path covering problems and testing of printed circuits, Trees, Paths, Stars, Caterpillars and Spiders, Graph factors and factorization: 1985--2003: a survey, The linear arboricity of graphs, Unnamed Item, An efficient case for computing minimum linear arboricity with small maximum degree, Edge coloring of signed 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, The structure of plane graphs with independent crossings and its applications to coloring problems, Minimum number of disjoint linear forests covering a planar graph, 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, Bounded size components -- partitions and transversals., Three ways to cover a graph, A decomposition method on solving the linear arboricity conjecture, Drawing Graphs on Few Lines and Few Planes, On the linear arboricity of graphs with treewidth at most four, On an \(f\)-coloring generalization of linear arboricity of multigraphs, The linear arboricity of planar graphs of maximum degree seven is four, Edge covering pseudo-outerplanar graphs with forests, Packing in regular graphs, Some problems about linear arboricity, Unnamed Item, The linear arboricity of planar graphs with maximum degree at least 5, Optimal path and cycle decompositions of dense quasirandom graphs, Unnamed Item, On the linear arboricity of graphs embeddable in surfaces, Partitioning regular graphs into equicardinal linear forests, Isomorphic bisections of cubic graphs, Towards the linear arboricity conjecture, An introduction to the discharging method via graph coloring, On isomorphic linear partitions in cubic graphs, Unnamed Item, On isomorphic linear partitions in cubic graphs, A note on the arboricity of graphs, Inapproximability of maximal strip recovery, An intermediate value theorem for the arboricities, Unnamed Item, Graph theory (algorithmic, algebraic, and metric problems), The linear arboricity of planar graphs with no short cycles, Unnamed Item, Linear arboricity of outer-1-planar graphs, The list linear arboricity of planar graphs with 7-cycles containing at most two chords, Linear arboricity of NIC-planar graphs, Drawing Graphs on Few Circles and Few Spheres, Monochromatic and heterochromatic subgraphs in edge-colored graphs - A survey, Unnamed Item, Unnamed Item, On linear k-arboricity, The star arboricity of graphs, Linear \(k\)-arboricities on trees, The linear arboricity of \(K_5\)-minor free graphs, Note on linear arboricity of graphs with large girth, Factorisation of regular graphs into forests of short paths, Two-coloring the edges of a cubic graph such that each monochromatic component is a path of length at most 5, Partitioning circulant graphs into isomorphic linear forests, Upper bound for linear arboricity, Acyclic edge-colorings of sparse graphs
Cites Work
