Pages that link to "Item:Q4354590"
From MaRDI portal
The following pages link to New Bounds on the List-Chromatic Index of the Complete Graph and Other Simple Graphs (Q4354590):
Displaying 41 items.
- The tournament scheduling problem with absences (Q323410) (← links)
- On-line list coloring of matroids (Q516838) (← links)
- A note on edge-choosability of planar graphs without intersecting 4-cycles (Q545596) (← links)
- Planar graphs with maximum degree \(\Delta \geq 9\) are \((\Delta +1)\)-edge-choosable--a short proof (Q710613) (← links)
- Proof of the list edge coloring conjecture for complete graphs of prime degree (Q743657) (← links)
- Delay colouring in quartic graphs (Q785576) (← 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)
- Tight embeddings of partial quadrilateral packings (Q965225) (← 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)
- Edge-choosability of planar graphs without adjacent triangles or without 7-cycles (Q998494) (← links)
- Edge choosability of planar graphs without 5-cycles with a chord (Q1025481) (← links)
- On list edge-colorings of subcubic graphs (Q1584301) (← links)
- Extension from precoloured sets of edges (Q1658745) (← links)
- List-edge-coloring of planar graphs without 6-cycles with three chords (Q1702837) (← links)
- Computing the list chromatic index of graphs (Q1711669) (← links)
- Edge choosability of planar graphs without small cycles (Q1827800) (← links)
- Choosability, edge choosability and total choosability of outerplane graphs (Q1840829) (← links)
- List edge colorings of planar graphs without adjacent 7-cycles (Q2035728) (← links)
- List edge coloring of planar graphs without 6-cycles with two chords (Q2214317) (← links)
- Coloring temporal graphs (Q2237899) (← links)
- Handling fairness issues in time-relaxed tournaments with availability constraints (Q2289924) (← links)
- List edge coloring of planar graphs without non-induced 6-cycles (Q2354599) (← links)
- The list-chromatic index of \(K_6\) (Q2436826) (← links)
- Edge-coloring almost bipartite multigraphs (Q2444912) (← links)
- Edge DP-coloring in planar graphs (Q2659224) (← links)
- Total choosability of multicircuits II (Q4537555) (← links)
- Edge-group choosability of outerplanar and near-outerplanar graphs (Q4997221) (← links)
- List edge and list total coloring of planar graphs without intersecting 8-cycles (Q5034571) (← links)
- On the chromatic index of generalized truncations (Q5089706) (← links)
- Two Chromatic Conjectures: One for Vertices and One for Edges (Q5506782) (← links)
- List Ramsey numbers (Q6055384) (← links)
- Graph and hypergraph colouring via nibble methods: a survey (Q6086395) (← links)
- Thresholds for Latin squares and Steiner triple systems: Bounds within a logarithmic factor (Q6135844) (← links)
- Edge-colouring graphs with local list sizes (Q6187343) (← links)
- Toward a three-dimensional counterpart of Cruse's theorem (Q6490371) (← links)
- Asymptotically good local list edge colourings (Q6621166) (← links)
- Sufficient conditions make graphs edge DP-\(\varDelta\)-colorable (Q6660052) (← links)
