Pages that link to "Item:Q684119"
From MaRDI portal
The following pages link to Correspondence coloring and its application to list-coloring planar graphs without cycles of lengths 4 to 8 (Q684119):
Displaying 50 items.
- Planar graphs without cycles of lengths 4 and 5 and close triangles are DP-3-colorable (Q2319718) (← links)
- Every planar graph without adjacent cycles of length at most 8 is 3-choosable (Q2323250) (← links)
- DP-4-colorability of two classes of planar graphs (Q2324485) (← links)
- Note on 3-choosability of planar graphs with maximum degree 4 (Q2324500) (← links)
- DP-degree colorable hypergraphs (Q2333798) (← links)
- On DP-coloring of graphs and multigraphs (Q2360256) (← links)
- Correspondence homomorphisms to reflexive graphs (Q2413143) (← links)
- DP-colorings of hypergraphs (Q2422217) (← links)
- Partial DP-coloring of graphs (Q2659213) (← links)
- Edge DP-coloring in planar graphs (Q2659224) (← links)
- Planar graphs without \(\{4, 6, 8\}\)-cycles are 3-choosable (Q2671068) (← links)
- Notes on the harmonic index of graphs (Q2678296) (← links)
- Cooperative colorings of forests (Q2684895) (← links)
- 4-choosability of planar graphs with 4-cycles far apart via the Combinatorial Nullstellensatz (Q2685332) (← links)
- Decomposition of planar graphs with forbidden configurations (Q2691577) (← links)
- Relation between the correspondence chromatic number and the Alon-Tarsi number (Q2699913) (← links)
- Non-chromatic-adherence of the DP color function via generalized theta graphs (Q2701400) (← links)
- 3-Paintability of planar graphs (Q4554554) (← links)
- Coloring permutation-gain graphs (Q4986271) (← links)
- DP-coloring on planar graphs without given adjacent short cycles (Q5012814) (← links)
- 不含带弦6-圈和项链图的平面图是DP-4-可染的 (Q5038381) (← links)
- Fractional DP-chromatic number of planar graphs of large girth (Q5063294) (← links)
- Planar graphs without intersecting 5-cycles are signed-4-choosable (Q5101876) (← links)
- Defective and clustered choosability of sparse graphs (Q5222556) (← links)
- Colouring graphs with forbidden bipartite subgraphs (Q5885184) (← links)
- Independent transversals in bipartite correspondence-covers (Q5888915) (← links)
- A local epsilon version of Reed's conjecture (Q5919302) (← links)
- Counting colorings of triangle-free graphs (Q6038582) (← links)
- Weak degeneracy of graphs (Q6047953) (← links)
- DP color functions versus chromatic polynomials (II) (Q6047960) (← links)
- ZDP(n) ${Z}_{DP}(n)$ is bounded above by n2−(n+3)∕2 ${n}^{2}-(n+3)\unicode{x02215}2$ (Q6047969) (← links)
- Adaptable and conflict colouring multigraphs with no cycles of length three or four (Q6047975) (← links)
- Single‐conflict colouring (Q6055933) (← links)
- Signed colouring and list colouring of k‐chromatic graphs (Q6057660) (← links)
- On colorings and orientations of signed graphs (Q6063839) (← links)
- DP‐coloring Cartesian products of graphs (Q6074580) (← links)
- Asymptotically good edge correspondence colourings (Q6081556) (← links)
- A \((2, 1)\)-decomposition of planar graphs without intersecting 3-cycles and adjacent \(4^-\)-cycles (Q6083188) (← links)
- Generalized DP-colorings of graphs (Q6091813) (← links)
- Decompositions of graphs of nonnegative characteristic with some forbidden subgraphs (Q6108003) (← links)
- Symmetric set coloring of signed graphs (Q6114964) (← links)
- Variable degeneracy on toroidal graphs (Q6143693) (← links)
- On the list color function threshold (Q6144915) (← links)
- Weak degeneracy of planar graphs without 4- and 6-cycles (Q6157423) (← links)
- A weak DP-partitioning of planar graphs without 4-cycles and 6-cycles (Q6173908) (← links)
- A weak DP-coloring of planar graphs without 4- and 9-cycles (Q6184347) (← links)
- On triangle-free list assignments (Q6184549) (← links)
- Packing list‐colorings (Q6185050) (← links)
- 5‐Coloring reconfiguration of planar graphs with no short odd cycles (Q6199387) (← links)
- An algebraic approach for counting DP-3-colorings of sparse graphs (Q6201884) (← links)
