A note on list arboricity
An analogue of the result by \textit{F. Galvin} [J. Comb. Theory, Ser. B 63, No. 1, 153-158 (1995; Zbl 0826.05026)] is proved for edge colorings of graphs. The result by Galvin asserts that for a bipartite graph the chromatic index and the list chromatic index are equal. In this note it is shown that if the edges of a graph \(G\) can be colored by \(k\) colors such that no circuit is monochromatic then for any assignment \(E\) of \(k\) colors \(E(e)\) to each edge \(e\) of \(G\) there is a coloring of the edges choosing colors from \(E(e)\) such that no circuit is monochromatic. The result is proved in a more general form for matroids which specializes to the above statement in case \(M\) is the graphical matroid of the graph \(G\).
- The list linear arboricity of graphs
- A note on the arboricity of graphs
- scientific article; zbMATH DE number 566421
- List point arboricity of graphs
- Some results on total arboricity and list total arboricity of graphs
- A note on disjoint arborescences
- On equitable list arboricity of graphs
- The list linear arboricity of planar graphs
- List point arboricity of dense graphs
- A weaker version of a conjecture on list vertex arboricity of graphs
- A note on restricted list edge-colourings
- List coloring of matroids and base exchange properties
- Regularity of symbolic powers and arboricity of matroids
- Indicated coloring of matroids
- Short Proof of Galvin's Theorem on the List-chromatic Index of a Bipartite Multigraph
- The coloring game on matroids
- List coloring of two matroids through reduction to partition matroids
- On-line list coloring of matroids
- The list linear arboricity of graphs
- Orientation‐based edge‐colorings and linear arboricity of multigraphs
- List total arboricity of 2-degenerate graphs
This page was built for publication: A note on list arboricity
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1386426)
