Pages that link to "Item:Q2360256"
From MaRDI portal
The following pages link to On DP-coloring of graphs and multigraphs (Q2360256):
Displaying 45 items.
- Correspondence coloring and its application to list-coloring planar graphs without cycles of lengths 4 to 8 (Q684119) (← links)
- The harmonic index of a graph and its DP-chromatic number (Q777446) (← links)
- DP-3-coloring of some planar graphs (Q1618234) (← links)
- A sufficient condition for DP-4-colorability (Q1752670) (← links)
- A note on the DP-chromatic number of complete bipartite graphs (Q1783631) (← links)
- Every planar graph without pairwise adjacent 3-, 4-, and 5-cycle is DP-4-colorable (Q1988544) (← links)
- Planar graphs without 4-cycles adjacent to triangles are DP-4-colorable (Q2000565) (← links)
- Sufficient conditions on planar graphs to have a relaxed DP-3-coloring (Q2000575) (← links)
- Combinatorial Nullstellensatz and DP-coloring of graphs (Q2005703) (← links)
- Answers to two questions on the DP color function (Q2030743) (← links)
- Differences between the list-coloring and DP-coloring for planar graphs (Q2032896) (← links)
- Group colorings and DP-colorings of multigraphs using edge-disjoint decompositions (Q2053689) (← links)
- An analogue of DP-coloring for variable degeneracy and its applications (Q2062675) (← links)
- Cover and variable degeneracy (Q2075519) (← links)
- DP-\(4\)-colorability of planar graphs without intersecting \(5\)-cycles (Q2075538) (← links)
- Relaxed DP-coloring and another generalization of DP-coloring on planar graphs without 4-cycles and 7-cycles (Q2107762) (← links)
- An extension of Thomassen's result on choosability (Q2139819) (← links)
- Upper bound for DP-chromatic number of a graph (Q2143040) (← links)
- A deletion-contraction relation for the DP color function (Q2156187) (← links)
- A generalization of some results on list coloring and DP-coloring (Q2191273) (← links)
- On-line DP-coloring of graphs (Q2197455) (← links)
- On the chromatic polynomial and counting DP-colorings of graphs (Q2221788) (← links)
- On 2-defective DP-colorings of sparse graphs (Q2225422) (← links)
- Defective DP-colorings of sparse multigraphs (Q2225451) (← links)
- Defective DP-colorings of sparse simple graphs (Q2237221) (← links)
- DP-4-colorability of planar graphs without adjacent cycles of given length (Q2306602) (← links)
- Planar graphs without cycles of lengths 4 and 5 and close triangles are DP-3-colorable (Q2319718) (← links)
- DP-degree colorable hypergraphs (Q2333798) (← links)
- DP-colorings of graphs with high chromatic number (Q2400975) (← links)
- DP-colorings of hypergraphs (Q2422217) (← links)
- On digraph coloring problems and treewidth duality (Q2427534) (← links)
- Partial DP-coloring of graphs (Q2659213) (← links)
- Planar graphs without \(\{4, 6, 8\}\)-cycles are 3-choosable (Q2671068) (← links)
- Notes on the harmonic index of graphs (Q2678296) (← links)
- On the f-coloring of multigraphs (Q3778781) (← links)
- On DP‐coloring of digraphs (Q5066911) (← links)
- Weak degeneracy of graphs (Q6047953) (← links)
- Generalized DP-colorings of graphs (Q6091813) (← links)
- Symmetric set coloring of signed graphs (Q6114964) (← links)
- The relation between the harmonic index and some coloring parameters (Q6151575) (← links)
- A weak DP-partitioning of planar graphs without 4-cycles and 6-cycles (Q6173908) (← links)
- Decomposition of toroidal graphs without some subgraphs (Q6178668) (← links)
- A weak DP-coloring of planar graphs without 4- and 9-cycles (Q6184347) (← links)
- An algebraic approach for counting DP-3-colorings of sparse graphs (Q6201884) (← links)
- Sparse critical graphs for defective DP-colorings (Q6204323) (← links)
