List edge and list total colourings of multigraphs
From MaRDI portal
Publication:1366604
DOI10.1006/jctb.1997.1780zbMath0876.05032OpenAlexW1995705069MaRDI QIDQ1366604
Oleg V. Borodin, Douglas R. Woodall, Alexandr V. Kostochka
Publication date: 15 September 1997
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/jctb.1997.1780
Related Items (only showing first 100 items - show all)
List edge and list total coloring of planar graphs without intersecting 8-cycles ⋮ Edge-face coloring of plane graphs with maximum degree nine ⋮ Total choosability of multicircuits I ⋮ Facial list colourings of plane graphs ⋮ Maximum average degree of list-edge-critical graphs and Vizing's conjecture ⋮ Every triangle-free induced subgraph of the triangular lattice is \((5m,2m)\)-choosable ⋮ Reconfiguration of List Edge-Colorings in a Graph ⋮ (2,1)-total labelling of planar graphs with large maximum degree ⋮ Edge-group choosability of outerplanar and near-outerplanar graphs ⋮ \( L ( p , q )\)-labelings of subdivisions of graphs ⋮ Edge DP-coloring in planar graphs ⋮ On the equitable edge-coloring of 1-planar graphs and planar graphs ⋮ Planar graphs with $\Delta\geq 8$ are ($\Delta+1$)-edge-choosable ⋮ List-Coloring Claw-Free Graphs with $\Delta-1$ Colors ⋮ Every planar graph with Δ ${\rm{\Delta }}$ ⩾ 8 is totally (Δ+2) $({\rm{\Delta }}+2)$‐choosable ⋮ Kempe equivalent list edge-colorings of planar graphs ⋮ Linear arboricity of degenerate graphs ⋮ Optimal channel assignment with list-edge coloring ⋮ Edge-colouring graphs with local list sizes ⋮ A note on list edge and list total coloring of planar graphs without adjacent short cycles ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Total colorings of planar graphs without chordal 6-cycles ⋮ Chromatic index, treewidth and maximum degree ⋮ COLORING ALGORITHMS ON SUBCUBIC GRAPHS ⋮ \((2,1)\)-total labelling of outerplanar graphs ⋮ An Improved Sufficient Condition for Reconfiguration of List Edge-Colorings in a Tree ⋮ Chromatic index, treewidth and maximum degree ⋮ Unnamed Item ⋮ A relation between choosability and uniquely list colorability ⋮ Vertex decompositions of sparse graphs into an edgeless subgraph and a subgraph of maximum degree at most k ⋮ List Edge-Coloring and Total Coloring in Graphs of Low Treewidth ⋮ Counterexamples to the List Square Coloring Conjecture ⋮ Tight Lower Bounds for List Edge Coloring ⋮ A Proof of a Conjecture of Ohba ⋮ Two Chromatic Conjectures: One for Vertices and One for Edges ⋮ On list incidentor (k, l)-coloring ⋮ A note on the minimum number of choosability of planar graphs ⋮ The total coloring of \(K_5\)-minor-free graphs ⋮ Weight of edges in normal plane maps ⋮ Total coloring of planar graphs without chordal 7-cycles ⋮ List-edge-colouring planar graphs with precoloured edges ⋮ The edge-face choosability of plane graphs ⋮ \((d,1)\)-total labelling of planar graphs with large girth and high maximum degree ⋮ On group choosability of total graphs ⋮ The List \(L(2, 1)\)-labeling of planar graphs ⋮ The tournament scheduling problem with absences ⋮ Neighbor sum distinguishing total choosability of planar graphs ⋮ Total coloring of claw-free planar graphs ⋮ List edge and list total coloring of planar graphs with maximum degree 8 ⋮ On the sizes of graphs embeddable in surfaces of nonnegative Euler characteristic and their applications to edge choosability ⋮ An extension of Kotzig's theorem ⋮ On avoiding odd partial Latin squares and \(r\)-multi Latin squares ⋮ Complexity separating classes for edge-colouring and total-colouring ⋮ The parameterised complexity of list problems on graphs of bounded treewidth ⋮ List edge and list total colorings of planar graphs without 4-cycles ⋮ \(L(2, 1)\)-labelings of the edge-path-replacement of a graph ⋮ Total colorings of embedded graphs with no 3-cycles adjacent to 4-cycles ⋮ Extension from precoloured sets of edges ⋮ Refined weight of edges in normal plane maps ⋮ \(L(d,1)\)-labelings of the edge-path-replacement of a graph ⋮ Edge-colouring and total-colouring chordless graphs ⋮ A sufficient condition for planar graphs of maximum degree 6 to be totally 7-colorable ⋮ List total coloring of pseudo-outerplanar graphs ⋮ A game generalizing Hall's theorem ⋮ Weight of 3-paths in sparse plane graphs ⋮ List injective colorings of planar graphs ⋮ Total choosability of planar graphs with maximum degree 4 ⋮ The structure of plane graphs with independent crossings and its applications to coloring problems ⋮ \((\Delta + 1)\)-total-colorability of plane graphs with maximum degree \(\Delta\) at least 6 and without adjacent short cycles ⋮ On the total choosability of planar graphs and of sparse graphs ⋮ The list edge coloring and list total coloring of planar graphs with maximum degree at least 7 ⋮ List total colorings of planar graphs without triangles at small distance ⋮ \((\Delta +1)\)-total-colorability of plane graphs of maximum degree \(\Delta\geq 6\) with neither chordal \(5\)-cycle nor chordal \(6\)-cycle ⋮ Total coloring of planar graphs with maximum degree \(7\) ⋮ List-edge-coloring of planar graphs without 6-cycles with three chords ⋮ (\( \Delta + 1\))-total choosability of planar graphs with no cycles of length from 4 to \(k\) and without close triangles ⋮ Total colorings of planar graphs with maximum degree seven and without intersecting 3-cycles ⋮ Edge choosability and total choosability of planar graphs with no 3-cycles adjacent 4-cycles ⋮ Total chromatic number of unichord-free graphs ⋮ \((p,q)\)-total labeling of complete graphs ⋮ List edge coloring of planar graphs without 6-cycles with two chords ⋮ Randomly colouring graphs (a combinatorial view) ⋮ Entire colouring of plane graphs ⋮ On \((p,1)\)-total labelling of 1-planar graphs ⋮ \(L(2,1)\)-labelings of subdivisions of graphs ⋮ Minimum total coloring of planar graph ⋮ Chromatic-choosability of the power of graphs ⋮ Adjacent vertex distinguishing total coloring of planar graphs with maximum degree 9 ⋮ On the Alon-Tarsi number and chromatic-choosability of Cartesian products of graphs ⋮ An introduction to the discharging method via graph coloring ⋮ On \((p,1)\)-total labelling of planar graphs ⋮ A totally \((\Delta + 1)\)-colorable 1-planar graph with girth at least five ⋮ Total equitable list coloring ⋮ A structure of 1-planar graph and its applications to coloring problems ⋮ List edge and list total coloring of 1-planar graphs ⋮ The average degree of a multigraph critical with respect to edge or total choosability ⋮ Bipartite graphs whose squares are not chromatic-choosable ⋮ A note on edge-choosability of planar graphs without intersecting 4-cycles ⋮ Injective colorings of graphs with low average degree
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A new upper bound for the list chromatic number
- Generalization of a theorem of Kotzig and a prescribed coloring of the edges of planar graphs
- The total coloring of a multigraph with maximal degree 4
- The total chromatic number of any multigraph with maximum degree five is at most seven
- Total colourings of planar graphs with large girth
- The list chromatic index of a bipartite multigraph
- Asymptotically good list-colorings
- On the total coloring of certain graphs
- On the total coloring of planar graphs.
- Some upper bounds on the total and list chromatic numbers of multigraphs
- Total colorings of planar graphs with large maximum degree
- Short Proof of Galvin's Theorem on the List-chromatic Index of a Bipartite Multigraph
- On Total Chromatic Number of a Graph
- A Theorem on Coloring the Lines of a Network
- The Factors of Graphs
- 25 pretty graph colouring problems
This page was built for publication: List edge and list total colourings of multigraphs
