New Bounds on the List-Chromatic Index of the Complete Graph and Other Simple Graphs
From MaRDI portal
Publication:4354590
DOI10.1017/S0963548397002927zbMATH Open0880.05035MaRDI QIDQ4354590FDOQ4354590
Authors: Roland Häggkvist, Jeannette Janssen 
Publication date: 19 January 1998
Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)
Recommendations
Cited In (46)
- Edge-choosability of planar graphs without adjacent triangles or without 7-cycles
- List edge coloring of planar graphs without 6-cycles with two chords
- Thresholds for Latin squares and Steiner triple systems: Bounds within a logarithmic factor
- Extension from precoloured sets of edges
- On-line list coloring of matroids
- List edge and list total colorings of planar graphs without short cycles
- A note on edge-choosability of planar graphs without intersecting 4-cycles
- Edge choosability of planar graphs without small cycles
- Edge-choosability of planar graphs without non-induced 5-cycles
- Some colouring problems for Paley graphs
- List edge and list total colorings of planar graphs without 4-cycles
- Title not available (Why is that?)
- On list edge-colorings of subcubic graphs
- Structural properties and edge choosability of planar graphs without 4-cycles
- On the sizes of graphs embeddable in surfaces of nonnegative Euler characteristic and their applications to edge choosability
- On the chromatic index of generalized truncations
- A new upper bound for the list chromatic number
- Choosability, edge choosability and total choosability of outerplane graphs
- Two Chromatic Conjectures: One for Vertices and One for Edges
- List Ramsey numbers
- Title not available (Why is that?)
- Handling fairness issues in time-relaxed tournaments with availability constraints
- List edge coloring of planar graphs without non-induced 6-cycles
- Edge DP-coloring in planar graphs
- The tournament scheduling problem with absences
- Edge-colouring graphs with local list sizes
- Asymptotically good local list edge colourings
- Coloring temporal graphs
- Title not available (Why is that?)
- Edge-group choosability of outerplanar and near-outerplanar graphs
- List edge colorings of planar graphs without adjacent 7-cycles
- Proof of the list edge coloring conjecture for complete graphs of prime degree
- Edge-coloring almost bipartite multigraphs
- Graph and hypergraph colouring via nibble methods: a survey
- Toward a three-dimensional counterpart of Cruse's theorem
- The list chromatic index of simple graphs whose odd cycles intersect in at most one edge
- Delay colouring in quartic graphs
- Computing the list chromatic index of graphs
- Tight embeddings of partial quadrilateral packings
- Sufficient conditions make graphs edge DP-\(\varDelta\)-colorable
- Edge choosability of planar graphs without 5-cycles with a chord
- List-edge-coloring of planar graphs without 6-cycles with three chords
- Total choosability of multicircuits II
- The list-chromatic index of \(K_6\)
- Planar graphs with maximum degree \(\Delta \geq 9\) are \((\Delta +1)\)-edge-choosable--a short proof
- List edge and list total coloring of planar graphs without intersecting 8-cycles
This page was built for publication: New Bounds on the List-Chromatic Index of the Complete Graph and Other Simple Graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4354590)
