Sufficient conditions make graphs edge DP-\(\varDelta\)-colorable
From MaRDI portal
Publication:6660052
DOI10.1007/S00373-024-02857-7MaRDI QIDQ6660052
Pongpat Sittitrai, W. Ruksasakchai
Publication date: 10 January 2025
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Correspondence coloring and its application to list-coloring planar graphs without cycles of lengths 4 to 8
- Structural properties and edge choosability of planar graphs without 4-cycles
- Generalization of a theorem of Kotzig and a prescribed coloring of the edges of planar graphs
- List edge and list total colourings of multigraphs
- On list edge-colorings of subcubic graphs
- Choosability and edge choosability of planar graphs without five cycles
- Edge choosability of planar graphs without small cycles
- Choosability, edge choosability and total choosability of outerplane graphs
- Planar graphs of maximum degree seven are Class I
- The list chromatic index of a bipartite multigraph
- List edge coloring of planar graphs without 6-cycles with two chords
- Edge DP-coloring in planar graphs
- Structural properties and edge choosability of planar graphs without 6-cycles
- Planar graphs with $\Delta\geq 8$ are ($\Delta+1$)-edge-choosable
- New Bounds on the List-Chromatic Index of the Complete Graph and Other Simple Graphs
- Graphs of degree 4 are 5-edge-choosable
- Edge-choosability and total-choosability of planar graphs with no adjacent 3-cycles
- Every planar graph with maximum degree 7 is of class 1
- On an estimate of the chromatic class of a \(p\)-graph
This page was built for publication: Sufficient conditions make graphs edge DP-\(\varDelta\)-colorable
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6660052)
