Pages that link to "Item:Q1892837"
From MaRDI portal
The following pages link to The list chromatic index of a bipartite multigraph (Q1892837):
Displaying 50 items.
- Coloring complete and complete bipartite graphs from random lists (Q292251) (← links)
- A note on total and list edge-colouring of graphs of tree-width 3 (Q293637) (← links)
- Vertex-distinguishing proper arc colorings of digraphs (Q298989) (← links)
- Jacobsthal numbers in generalised Petersen graphs (Q322296) (← links)
- The tournament scheduling problem with absences (Q323410) (← links)
- The parameterised complexity of list problems on graphs of bounded treewidth (Q342709) (← links)
- A game generalizing Hall's theorem (Q394371) (← links)
- Application of polynomial method to on-line list colouring of graphs (Q412279) (← links)
- On the intricacy of avoiding multiple-entry arrays (Q456895) (← links)
- Chromatic-choosability of the power of graphs (Q476310) (← links)
- Orientations of graphs with prescribed weighted out-degrees (Q489364) (← links)
- On-line choice number of complete multipartite graphs: an algorithmic approach (Q490305) (← links)
- On the choosability of claw-free perfect graphs (Q503632) (← links)
- An introduction to the discharging method via graph coloring (Q507506) (← links)
- On-line list coloring of matroids (Q516838) (← links)
- A note on edge-choosability of planar graphs without intersecting 4-cycles (Q545596) (← links)
- On two generalizations of the Alon-Tarsi polynomial method (Q651032) (← links)
- On the Alon-Tarsi number and chromatic-choosability of Cartesian products of graphs (Q668046) (← links)
- Planar graphs with maximum degree \(\Delta \geq 9\) are \((\Delta +1)\)-edge-choosable--a short proof (Q710613) (← links)
- Chip games and paintability (Q726662) (← links)
- On the choice number of complete multipartite graphs with part size four (Q739044) (← links)
- Some colouring problems for Paley graphs (Q817760) (← links)
- On the sizes of graphs embeddable in surfaces of nonnegative Euler characteristic and their applications to edge choosability (Q854811) (← links)
- List edge and list total colorings of planar graphs without 4-cycles (Q861265) (← links)
- Extending Hall's theorem into list colorings: a partial history (Q925374) (← links)
- Hall number for list colorings of graphs: Extremal results (Q960954) (← 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)
- The chromatic polynomial and list colorings (Q1003851) (← links)
- Edge choosability of planar graphs without 5-cycles with a chord (Q1025481) (← links)
- Some results on \((a:b)\)-choosability (Q1025484) (← links)
- Multigraphs with \(\Delta \geq 3\) are totally-\((2\Delta - 1)\)-choosable (Q1043786) (← links)
- On list critical graphs (Q1044925) (← links)
- The Hall number, the Hall index, and the total Hall number of a graph (Q1293202) (← links)
- Edge-choosability in line-perfect multigraphs (Q1301714) (← links)
- Edge-choosability of multicircuits (Q1301722) (← links)
- Choice number of 3-colorable elementary graphs (Q1356789) (← links)
- On the number of even and odd Latin squares of order \(p+1\) (Q1362611) (← links)
- Arrays of distinct representatives --- a very simple NP-complete problem (Q1363713) (← links)
- List edge and list total colourings of multigraphs (Q1366604) (← links)
- A vertex-splitting lemma, de Werra's theorem and improper list colourings (Q1366607) (← links)
- A note on list arboricity (Q1386426) (← links)
- Wide partitions, Latin tableaux, and Rota's basis conjecture (Q1415381) (← links)
- On list edge-colorings of subcubic graphs (Q1584301) (← links)
- On kernel-perfect orientations of line graphs (Q1584425) (← links)
- Completing some partial Latin squares (Q1587908) (← links)
- Planar graphs of girth at least five are square \((\delta + 2)\)-choosable (Q1633752) (← links)
