Pages that link to "Item:Q1366604"
From MaRDI portal
The following pages link to List edge and list total colourings of multigraphs (Q1366604):
Displayed 29 items.
- On the sizes of graphs embeddable in surfaces of nonnegative Euler characteristic and their applications to edge choosability (Q854811) (← links)
- On avoiding odd partial Latin squares and \(r\)-multi Latin squares (Q860463) (← links)
- List edge and list total colorings of planar graphs without 4-cycles (Q861265) (← links)
- 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)
- 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)
- 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)
- Completing some partial Latin squares (Q1587908) (← links)
- List total colorings of series-parallel graphs (Q1775015) (← 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)
- Chromatic index of graphs with no cycle with a unique chord (Q2267844) (← links)
- \((d,1)\)-total labelling of planar graphs with large girth and high maximum degree (Q2370454) (← links)
- \((2,1)\)-total labelling of outerplanar graphs (Q2462398) (← links)
- A relation between choosability and uniquely list colorability (Q2496207) (← links)
- Reconfiguration of List Edge-Colorings in a Graph (Q3183470) (← links)
- Total choosability of multicircuits I (Q4537554) (← links)
- COLORING ALGORITHMS ON SUBCUBIC GRAPHS (Q5696963) (← links)