Choosability conjectures and multicircuits
For a graph \(G\), let \(\chi(G)\), \(\chi'(G)\) and \(\chi(G)\) respectively be the ordinary vertex, edge and total chromatic number. Let \(\text{ch}(G)\), \(\text{ch}'(G)\) and \(ch(G)\) be the list (vertex), list (edge) and list total chromatic number of a graph \(G\). Several old and new conjectures about choosability in graphs are discussed. Some of them are the following conjectures. The list-edge-colouring conjecture (LECC): For every multigraph \(G\), \(\text{ch}'(G)=\chi'(G)\). The list-total-colouring conjecture (LTCC): For every multigraph \(G\), \(\text{ch}(G)=\chi(G)\). The list-square-colouring conjecture (LSCC): For every graph \(G\), \(\text{ch}(G^2)=\chi(G^2)\), where \(G^2\) is the square of \(G\). In this paper LSCC and LTCC are verified for some classes of graphs which bring the authors to new conjectures.
- Total choosability of multicircuits II
- Total choosability of multicircuits I
- Edge-choosability of multicircuits
- Choosability of powers of circuits
- Circular choosability via combinatorial Nullstellensatz
- scientific article; zbMATH DE number 6374014
- Choosability in simple hypergraphs
- A refinement of choosability of graphs
- The Computational Complexity of Choice Sets
- Choosability in random hypergraphs
- Choosability of the square of planar subcubic graphs with large girth
- A Brooks-type bound for squares of \(K_{4}\)-minor-free graphs
- Edge-choosability of multicircuits
- List 2-distance \(\varDelta +3\)-coloring of planar graphs without 4,5-cycles
- Total equitable list coloring
- Strong list-chromatic index of subcubic graphs
- An optimal square coloring of planar graphs
- Graph \(r\)-hued colorings -- a survey
- Bipartite graphs whose squares are not chromatic-choosable
- A unified approach to distance-two colouring of graphs on surfaces
- Towards an on-line version of Ohba's conjecture
- 2-distance choosability of planar graphs with a restriction for maximum degree
- 2-distance coloring of sparse graphs
- scientific article; zbMATH DE number 6374014 (Why is no real title available?)
- Coloring the square of a sparse graph G with almost (G) colors
- List Colouring Squares of Planar Graphs
- The edge choosability of \(C_{n} \times P_{m}\).
- Graphs with maximum degree 17 and maximum average degree less than 3 are list 2-distance ( +2)-colorable
- A note on list-coloring powers of graphs
- List Total Colourings of Graphs
- Total choosability of multicircuits I
- Total choosability of multicircuits II
- Chromatic-choosability of the power of graphs
- On-line choice number of complete multipartite graphs: an algorithmic approach
- Counterexamples to the list square coloring conjecture
- An introduction to the discharging method via graph coloring
- A proof of a conjecture of Ohba
- 2-distance coloring of sparse graphs
- List strong and list normal edge-coloring of (sub)cubic graphs
- Minimum non-chromatic--choosable graphs (extended abstract)
- Sufficient sparseness conditions for \(G^2\) to be \((\Delta + 1)\)-choosable, when \(\Delta \geq 5\)
- List-colouring the square of a \(K_4\)-minor-free graph
This page was built for publication: Choosability conjectures and multicircuits
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5948972)
