Pages that link to "Item:Q4020707"
From MaRDI portal
The following pages link to Some upper bounds on the total and list chromatic numbers of multigraphs (Q4020707):
Displaying 46 items.
- A note on the minimum number of choosability of planar graphs (Q266020) (← links)
- List edge and list total coloring of planar graphs with maximum degree 8 (Q328709) (← links)
- The parameterised complexity of list problems on graphs of bounded treewidth (Q342709) (← links)
- Application of polynomial method to on-line list colouring of graphs (Q412279) (← links)
- On the choosability of claw-free perfect graphs (Q503632) (← links)
- A note on edge-choosability of planar graphs without intersecting 4-cycles (Q545596) (← links)
- On the Alon-Tarsi number and chromatic-choosability of Cartesian products of graphs (Q668046) (← links)
- Chromatic-choosability of hypergraphs with high chromatic number (Q668048) (← links)
- Recent results on the total chromatic number (Q686483) (← links)
- Minimum choosability of planar graphs (Q724728) (← links)
- List edge and list total colorings of planar graphs without 4-cycles (Q861265) (← links)
- List edge and list total colorings of planar graphs without short cycles (Q975488) (← links)
- Edge-choosability of planar graphs without non-induced 5-cycles (Q976112) (← links)
- Structural properties and edge choosability of planar graphs without 4-cycles (Q998462) (← links)
- Choice number of complete multipartite graphs \(K_{3*3,2*(k - 5),1*2}\) and \(K_{4,3*2,2*(k - 6),1*3}\) (Q998482) (← links)
- Edge-choosability of planar graphs without adjacent triangles or without 7-cycles (Q998494) (← links)
- Total colorings and list total colorings of planar graphs without intersecting 4-cycles (Q1045095) (← links)
- Edge-choosability of multicircuits (Q1301722) (← links)
- Recent developments in total colouring (Q1322273) (← links)
- The total chromatic number of any multigraph with maximum degree five is at most seven (Q1356668) (← links)
- Choice number of 3-colorable elementary graphs (Q1356789) (← links)
- List edge and list total colourings of multigraphs (Q1366604) (← links)
- On the choice number of claw-free perfect graphs (Q1422425) (← links)
- List-edge-coloring of planar graphs without 6-cycles with three chords (Q1702837) (← links)
- Choosability, edge choosability and total choosability of outerplane graphs (Q1840829) (← links)
- List edge colorings of planar graphs without adjacent 7-cycles (Q2035728) (← links)
- Restricted extension of sparse partial edge colorings of hypercubes (Q2198375) (← links)
- List edge coloring of planar graphs without 6-cycles with two chords (Q2214317) (← links)
- On the total proper connection of graphs (Q2272614) (← links)
- List coloring a Cartesian product with a complete bipartite factor (Q2287748) (← links)
- List edge coloring of planar graphs without non-induced 6-cycles (Q2354599) (← links)
- Optimal channel assignment with list-edge coloring (Q2424801) (← links)
- A note on list edge and list total coloring of planar graphs without adjacent short cycles (Q2440495) (← links)
- Towards an on-line version of Ohba's conjecture (Q2441619) (← links)
- On choosability of some complete multipartite graphs and Ohba's conjecture (Q2463475) (← links)
- A relation between choosability and uniquely list colorability (Q2496207) (← links)
- Edge DP-coloring in planar graphs (Q2659224) (← links)
- Restricted extension of sparse partial edge colorings of complete graphs (Q2662349) (← links)
- A Survey on the Computational Complexity of Coloring Graphs with Forbidden Subgraphs (Q2978179) (← links)
- On chromatic‐choosable graphs (Q4539876) (← links)
- List edge and list total coloring of planar graphs without intersecting 8-cycles (Q5034571) (← links)
- A Proof of a Conjecture of Ohba (Q5251204) (← links)
- Two Chromatic Conjectures: One for Vertices and One for Edges (Q5506782) (← links)
- Amenable colorings (Q5906786) (← links)
- Bad list assignments for non‐k $k$‐choosable k $k$‐chromatic graphs with 2k+2 $2k+2$‐vertices (Q6084712) (← links)
- A short proof that the list packing number of any graph is well defined (Q6091812) (← links)
