Pages that link to "Item:Q1366604"
From MaRDI portal
The following pages link to List edge and list total colourings of multigraphs (Q1366604):
Displaying 50 items.
- List-edge and list-total colorings of graphs embedded on hyperbolic surfaces (Q998357) (← 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)
- The edge-face coloring of graphs embedded in a surface of characteristic zero (Q1025544) (← links)
- Planar graphs without 5-cycles or without 6-cycles (Q1025913) (← links)
- List edge multicoloring in graphs with few cycles (Q1029053) (← links)
- On \((d,1)\)-total numbers of graphs (Q1043541) (← links)
- Multigraphs with \(\Delta \geq 3\) are totally-\((2\Delta - 1)\)-choosable (Q1043786) (← links)
- On the 7 total colorability of planar graphs with maximum degree 6 and without 4-cycles (Q1043815) (← links)
- Total colorings and list total colorings of planar graphs without intersecting 4-cycles (Q1045095) (← links)
- List-colourings of graphs (Q1084403) (← links)
- List edge chromatic number of graphs with large girth (Q1197027) (← 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)
- A vertex-splitting lemma, de Werra's theorem and improper list colourings (Q1366607) (← links)
- Completing some partial Latin squares (Q1587908) (← links)
- List-edge-colouring planar graphs with precoloured edges (Q1621065) (← links)
- The List \(L(2, 1)\)-labeling of planar graphs (Q1637136) (← links)
- Total colorings of embedded graphs with no 3-cycles adjacent to 4-cycles (Q1656911) (← links)
- Extension from precoloured sets of edges (Q1658745) (← links)
- List-edge-coloring of planar graphs without 6-cycles with three chords (Q1702837) (← links)
- A note on restricted list edge-colourings (Q1715081) (← links)
- Adjacent vertex distinguishing total coloring of planar graphs with maximum degree 9 (Q1732773) (← links)
- Total equitable list coloring (Q1756126) (← links)
- List total colorings of series-parallel graphs (Q1775015) (← links)
- List edge-colorings of series-parallel graphs (Q1808155) (← links)
- Research problems from the 18th British Combinatorial Conference (Q1810663) (← links)
- Edge choosability of planar graphs without small cycles (Q1827800) (← links)
- Choosability, edge choosability and total choosability of outerplane graphs (Q1840829) (← links)
- The edge-face choosability of plane graphs (Q1883606) (← links)
- The list chromatic index of a bipartite multigraph (Q1892837) (← links)
- The structure of plane graphs with independent crossings and its applications to coloring problems (Q1935605) (← links)
- List total colorings of planar graphs without triangles at small distance (Q1942193) (← links)
- \((\Delta +1)\)-total-colorability of plane graphs of maximum degree \(\Delta\geq 6\) with neither chordal \(5\)-cycle nor chordal \(6\)-cycle (Q1944131) (← links)
- Total coloring of planar graphs with maximum degree \(7\) (Q1944191) (← links)
- \((p,q)\)-total labeling of complete graphs (Q1956251) (← links)
- A structure of 1-planar graph and its applications to coloring problems (Q2000562) (← links)
- List edge coloring of outer-1-planar graphs (Q2023746) (← links)
- List edge colorings of planar graphs without adjacent 7-cycles (Q2035728) (← links)
- Vizing's and Shannon's theorems for defective edge colouring (Q2094863) (← links)
- The total coloring of \(K_5\)-minor-free graphs (Q2122692) (← links)
- Total coloring of claw-free planar graphs (Q2151210) (← links)
- Vertex colourings of multigraphs with forbiddances on edges (Q2182245) (← links)
- A sufficient condition for planar graphs of maximum degree 6 to be totally 7-colorable (Q2183240) (← links)
- The list edge coloring and list total coloring of planar graphs with maximum degree at least 7 (Q2194528) (← links)
- List edge coloring of planar graphs without 6-cycles with two chords (Q2214317) (← links)
- Bipartite graphs whose squares are not chromatic-choosable (Q2260619) (← links)
- Chromatic index of graphs with no cycle with a unique chord (Q2267844) (← links)
