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.
- A note on the minimum number of choosability of planar graphs (Q266020) (← links)
- Weight of edges in normal plane maps (Q271617) (← links)
- Total coloring of planar graphs without chordal 7-cycles (Q272520) (← links)
- The tournament scheduling problem with absences (Q323410) (← links)
- Neighbor sum distinguishing total choosability of planar graphs (Q326491) (← links)
- List edge and list total coloring of planar graphs with maximum degree 8 (Q328709) (← links)
- An extension of Kotzig's theorem (Q339478) (← links)
- The parameterised complexity of list problems on graphs of bounded treewidth (Q342709) (← links)
- \(L(d,1)\)-labelings of the edge-path-replacement of a graph (Q386438) (← links)
- Edge-colouring and total-colouring chordless graphs (Q389214) (← links)
- List total coloring of pseudo-outerplanar graphs (Q393451) (← links)
- A game generalizing Hall's theorem (Q394371) (← links)
- \((\Delta + 1)\)-total-colorability of plane graphs with maximum degree \(\Delta\) at least 6 and without adjacent short cycles (Q407567) (← links)
- On the total choosability of planar graphs and of sparse graphs (Q407575) (← links)
- (\( \Delta + 1\))-total choosability of planar graphs with no cycles of length from 4 to \(k\) and without close triangles (Q432709) (← links)
- Randomly colouring graphs (a combinatorial view) (Q458462) (← links)
- \(L(2,1)\)-labelings of subdivisions of graphs (Q472974) (← links)
- Minimum total coloring of planar graph (Q475814) (← links)
- Chromatic-choosability of the power of graphs (Q476310) (← links)
- An introduction to the discharging method via graph coloring (Q507506) (← links)
- On \((p,1)\)-total labelling of planar graphs (Q512891) (← links)
- A totally \((\Delta + 1)\)-colorable 1-planar graph with girth at least five (Q520529) (← links)
- A note on edge-choosability of planar graphs without intersecting 4-cycles (Q545596) (← links)
- Injective colorings of graphs with low average degree (Q548659) (← links)
- List injective colorings of planar graphs (Q615993) (← links)
- Total choosability of planar graphs with maximum degree 4 (Q617905) (← links)
- Total colorings of planar graphs with maximum degree seven and without intersecting 3-cycles (Q641163) (← links)
- Edge choosability and total choosability of planar graphs with no 3-cycles adjacent 4-cycles (Q641187) (← links)
- Total chromatic number of unichord-free graphs (Q643026) (← links)
- Entire colouring of plane graphs (Q651038) (← links)
- On \((p,1)\)-total labelling of 1-planar graphs (Q651281) (← links)
- On the Alon-Tarsi number and chromatic-choosability of Cartesian products of graphs (Q668046) (← links)
- List edge and list total coloring of 1-planar graphs (Q692658) (← links)
- Planar graphs with maximum degree 7 and without 5-cycles are 8-totally-colorable (Q708386) (← links)
- Injective colorings of sparse graphs (Q710598) (← links)
- Planar graphs with maximum degree \(\Delta \geq 9\) are \((\Delta +1)\)-edge-choosable--a short proof (Q710613) (← links)
- Reconfiguration of list edge-colorings in a graph (Q713316) (← links)
- Minimum choosability of planar graphs (Q724728) (← links)
- Every triangulated 3-polytope of minimum degree 4 has a 4-path of weight at most 27 (Q727044) (← links)
- List coloring the square of sparse graphs with large degree (Q740267) (← links)
- 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)
- Weight of 3-paths in sparse plane graphs (Q888584) (← links)
- The average degree of a multigraph critical with respect to edge or total choosability (Q966012) (← 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)
- 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)
