Pages that link to "Item:Q1366604"

The following pages link to List edge and list total colourings of multigraphs (Q1366604):

Displaying 50 items.

• A structural theorem for planar graphs with some applications (Q2275921) (← links)
• A refinement of choosability of graphs (Q2284741) (← links)
• List coloring a Cartesian product with a complete bipartite factor (Q2287748) (← links)
• Handling fairness issues in time-relaxed tournaments with availability constraints (Q2289924) (← links)
• Goldberg's conjecture is true for random multigraphs (Q2312622) (← links)
• List edge coloring of planar graphs without non-induced 6-cycles (Q2354599) (← links)
• \((d,1)\)-total labelling of planar graphs with large girth and high maximum degree (Q2370454) (← links)
• On group choosability of total graphs (Q2376095) (← links)
• Complexity separating classes for edge-colouring and total-colouring (Q2391946) (← links)
• \(L(2, 1)\)-labelings of the edge-path-replacement of a graph (Q2392735) (← links)
• Refined weight of edges in normal plane maps (Q2401800) (← links)
• On the equitable edge-coloring of 1-planar graphs and planar graphs (Q2409529) (← links)
• Optimal channel assignment with list-edge coloring (Q2424801) (← links)
• A note on list edge and list total coloring of planar graphs without adjacent short cycles (Q2440495) (← links)
• Edge-coloring almost bipartite multigraphs (Q2444912) (← links)
• Total colorings of planar graphs without chordal 6-cycles (Q2449112) (← links)
• \((2,1)\)-total labelling of outerplanar graphs (Q2462398) (← links)
• A relation between choosability and uniquely list colorability (Q2496207) (← links)
• Facial list colourings of plane graphs (Q2629297) (← links)
• Every triangle-free induced subgraph of the triangular lattice is \((5m,2m)\)-choosable (Q2636827) (← links)
• \( L ( p , q )\)-labelings of subdivisions of graphs (Q2659077) (← links)
• Edge DP-coloring in planar graphs (Q2659224) (← links)
• Restricted edge-colourings of bipartite graphs (Q2785371) (← links)
• List edge-coloring and total coloring in graphs of low treewidth (Q2800543) (← links)
• Balanced list edge-colourings of bipartite graphs (Q2861497) (← links)
• Planar graphs with $\Delta\geq 8$ are ($\Delta+1$)-edge-choosable (Q2947439) (← links)
• An Improved Sufficient Condition for Reconfiguration of List Edge-Colorings in a Tree (Q3010389) (← links)
• Vertex decompositions of sparse graphs into an edgeless subgraph and a subgraph of maximum degree at most k (Q3055928) (← links)
• Edge-face coloring of plane graphs with maximum degree nine (Q3168662) (← links)
• Reconfiguration of List Edge-Colorings in a Graph (Q3183470) (← links)
• (Q3323976) (← links)
• A note on list-colorings (Q3828020) (← links)
• Asymptotics of the list-chromatic index for multigraphs (Q4511485) (← links)
• Total choosability of multicircuits I (Q4537554) (← links)
• Counterexamples to the List Square Coloring Conjecture (Q4982285) (← links)
• Edge-group choosability of outerplanar and near-outerplanar graphs (Q4997221) (← links)
• (Q5026976) (← links)
• List edge and list total coloring of planar graphs without intersecting 8-cycles (Q5034571) (← links)
• Maximum average degree of list-edge-critical graphs and Vizing's conjecture (Q5054037) (← links)
• (2,1)-total labelling of planar graphs with large maximum degree (Q5069984) (← links)
• (Q5081905) (← links)
• Tight Lower Bounds for List Edge Coloring (Q5116492) (← links)
• Efficiently list-edge coloring multigraphs asymptotically optimally (Q5146931) (← links)
• A Proof of a Conjecture of Ohba (Q5251204) (← links)
• On list incidentor (k, l)-coloring (Q5269157) (← links)
• List-Coloring Claw-Free Graphs with $\Delta-1$ Colors (Q5346550) (← links)
• Two Chromatic Conjectures: One for Vertices and One for Edges (Q5506782) (← links)
• COLORING ALGORITHMS ON SUBCUBIC GRAPHS (Q5696963) (← links)
• Chromatic index, treewidth and maximum degree (Q5892299) (← links)
• Chromatic index, treewidth and maximum degree (Q5916063) (← links)