On an \(f\)-coloring generalization of linear arboricity of multigraphs
From MaRDI portal
Publication:6184546
DOI10.1016/j.disc.2023.113777arXiv2301.09933OpenAlexW4388473630MaRDI QIDQ6184546
Publication date: 25 January 2024
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2301.09933
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Extremal problems for transversals in graphs with bounded degree
- The linear arboricity of graphs
- Decompositions of graphs into forests with bounded maximum degree
- On two minimax theorems in graph
- Probabilistic methods in coloring and decomposition problems
- Acyclic edge-colorings of sparse graphs
- The linear arboricity of series-parallel graphs
- Towards the linear arboricity conjecture
- Linear arboricity of regular digraphs
- On the degrees of the vertices of a directed graph
- A Note on Vertex List Colouring
- Eigenvalues of K1,k-Free Graphs and the Connectivity of Their Independence Complexes
- The linear arboricity of planar graphs of maximum degree seven is four
- The linear arboricity of some regular graphs
- A generalization of edge-coloring in graphs
- On the f-coloring of multigraphs
- Linear arboricity of digraphs
- Covering and packing in graphs IV: Linear arboricity
- Complexité de l'arboricité linéaire d'un graphe
- Characterizations of graphs having orientations satisfying local degree restrictions
- On Multi-Colourings of Cubic Graphs, and Conjectures of Fulkerson and Tutte
- Short Tours through Large Linear Forests
- COVERING AND PACKING IN GRAPHS, I.
- Decomposition of Finite Graphs Into Forests
- Linear arboricity and linear \(k\)-arboricity of regular graphs
- An improved bound for the linear arboricity conjecture
- Linear arboricity of degenerate graphs
- Orientation‐based edge‐colorings and linear arboricity of multigraphs
