The list chromatic index of a bipartite multigraph
From MaRDI portal
Publication:1892837
DOI10.1006/jctb.1995.1011zbMath0826.05026OpenAlexW2025328375WikidataQ55879872 ScholiaQ55879872MaRDI QIDQ1892837
Publication date: 2 July 1995
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/jctb.1995.1011
Related Items
Hownotto prove the Alon-Tarsi conjecture, The total coloring of \(K_5\)-minor-free graphs, Avoiding and extending partial edge colorings of hypercubes, Rainbow and monochromatic circuits and cocircuits in binary matroids, The edge-face choosability of plane graphs, Coloring complete and complete bipartite graphs from random lists, A note on total and list edge-colouring of graphs of tree-width 3, Vertex-distinguishing proper arc colorings of digraphs, Planar graphs of girth at least five are square \((\delta + 2)\)-choosable, Jacobsthal numbers in generalised Petersen graphs, The tournament scheduling problem with absences, Choice number of 3-colorable elementary graphs, On the sizes of graphs embeddable in surfaces of nonnegative Euler characteristic and their applications to edge choosability, Choice numbers of multi-bridge graphs, On the number of even and odd Latin squares of order \(p+1\), Arrays of distinct representatives --- a very simple NP-complete problem, The parameterised complexity of list problems on graphs of bounded treewidth, List edge and list total colorings of planar graphs without 4-cycles, List edge and list total colourings of multigraphs, A vertex-splitting lemma, de Werra's theorem and improper list colourings, Extension from precoloured sets of edges, The terminal-pairability problem in complete bipartite graphs, Edge DP-coloring in planar graphs, Restricted extension of sparse partial edge colorings of complete graphs, On restricted colorings of (d, s)-edge colorable graphs, A note on list arboricity, Vertex colourings of multigraphs with forbiddances on edges, A game generalizing Hall's theorem, The list chromatic index of simple graphs whose odd cycles intersect in at most one edge, Application of polynomial method to on-line list colouring of graphs, Jacobsthal Numbers in Generalized Petersen Graphs, Restricted extension of sparse partial edge colorings of hypercubes, List-edge-coloring of planar graphs without 6-cycles with three chords, Perfect graphs, kernels, and cores of cooperative games, The list-chromatic index of \(K_6\), Wide partitions, Latin tableaux, and Rota's basis conjecture, Computing the list chromatic index of graphs, List edge coloring of planar graphs without 6-cycles with two chords, On the intricacy of avoiding multiple-entry arrays, Edge-coloring almost bipartite multigraphs, On two generalizations of the Alon-Tarsi polynomial method, Extending Hall's theorem into list colorings: a partial history, On the chromatic polynomial and counting DP-colorings of graphs, Chromatic-choosability of the power of graphs, Orientations of graphs with prescribed weighted out-degrees, On-line choice number of complete multipartite graphs: an algorithmic approach, Independent systems of representatives in weighted graphs, On the Alon-Tarsi number and chromatic-choosability of Cartesian products of graphs, On choosability of some complete multipartite graphs and Ohba's conjecture, Coloring temporal graphs, Neighbor sum distinguishing list total coloring of subcubic graphs, On the choosability of claw-free perfect graphs, \((p,1)\)-total labelling of graphs, An introduction to the discharging method via graph coloring, On-line list coloring of matroids, On adjacent vertex-distinguishing total chromatic number of generalized Mycielski graphs, Hall number for list colorings of graphs: Extremal results, Stable matchings in three-sided systems with cyclic preferences, A note on edge-choosability of planar graphs without intersecting 4-cycles, List edge and list total colorings of planar graphs without short cycles, Edge-choosability of planar graphs without non-induced 5-cycles, Unnamed Item, Planar graphs with maximum degree \(\Delta \geq 9\) are \((\Delta +1)\)-edge-choosable--a short proof, A relation between choosability and uniquely list colorability, On the total proper connection of graphs, Restricted Edge-colourings of Bipartite Graphs, A note on the DP-chromatic number of complete bipartite graphs, Answers to two questions on the DP color function, Chip games and paintability, Perfect graphs with polynomially computable kernels, Structural properties and edge choosability of planar graphs without 4-cycles, Choice number of complete multipartite graphs \(K_{3*3,2*(k - 5),1*2}\) and \(K_{4,3*2,2*(k - 6),1*3}\), Edge-choosability of planar graphs without adjacent triangles or without 7-cycles, List edge colorings of planar graphs without adjacent 7-cycles, List Edge-Coloring and Total Coloring in Graphs of Low Treewidth, List coloring a Cartesian product with a complete bipartite factor, Handling fairness issues in time-relaxed tournaments with availability constraints, The chromatic polynomial and list colorings, On the choice number of complete multipartite graphs with part size four, Edge choosability of planar graphs without 5-cycles with a chord, Some results on \((a:b)\)-choosability, Goldberg's conjecture is true for random multigraphs, Edge choosability of planar graphs without small cycles, List edge colourings of some 1-factorable multigraphs, Multigraphs with \(\Delta \geq 3\) are totally-\((2\Delta - 1)\)-choosable, The Hall number, the Hall index, and the total Hall number of a graph, On list critical graphs, Choosability, edge choosability and total choosability of outerplane graphs, On list edge-colorings of subcubic graphs, On kernel-perfect orientations of line graphs, Edge-choosability in line-perfect multigraphs, Edge-choosability of multicircuits, Completing some partial Latin squares, On structure of some plane graphs with application to choosability, Asymptotically the list colouring constants are 1, Gridline graphs: A review in two dimensions and an extension to higher dimensions, List coloring of matroids and base exchange properties, An online version of Rota's basis conjecture, List edge coloring of planar graphs without non-induced 6-cycles, Some colouring problems for Paley graphs, List edge and list total coloring of planar graphs without intersecting 8-cycles, The Strong Fractional Choice Number and the Strong Fractional Paint Number of Graphs, Total choosability of multicircuits I, On chromatic‐choosable graphs, Maximum average degree of list-edge-critical graphs and Vizing's conjecture, Edge-group choosability of outerplanar and near-outerplanar graphs, List-Coloring Claw-Free Graphs with $\Delta-1$ Colors, Algorithmic aspects of small quasi-kernels, List Ramsey numbers, Asymptotically good edge correspondence colourings, Bad list assignments for non‐k $k$‐choosable k $k$‐chromatic graphs with 2k+2 $2k+2$‐vertices, A short proof that the list packing number of any graph is well defined, Orientation‐based edge‐colorings and linear arboricity of multigraphs, 5-list coloring toroidal 6-regular triangulations in linear time, Thresholds for Latin squares and Steiner triple systems: Bounds within a logarithmic factor, On triangle-free list assignments, Edge-colouring graphs with local list sizes, A Survey on the Computational Complexity of Coloring Graphs with Forbidden Subgraphs, Short Proof of Galvin's Theorem on the List-chromatic Index of a Bipartite Multigraph, Unnamed Item, COLORING ALGORITHMS ON SUBCUBIC GRAPHS, List Coloring of Two Matroids through Reduction to Partition Matroids, On list coloring Steiner triple systems, Completing Partial Schedules for Open Shop with Unit Processing Times and Routing, SEMIREGULAR FACTORIZATIONS OF REGULAR MULTIGRAPHS, Amenable colorings, Counterexamples to the List Square Coloring Conjecture, Tight Lower Bounds for List Edge Coloring, A Proof of a Conjecture of Ohba, Two Chromatic Conjectures: One for Vertices and One for Edges, A brief history of edge-colorings – with personal reminiscences, Extremal jumps of the Hall number
