Pages that link to "Item:Q2563511"
From MaRDI portal
The following pages link to List edge colourings of some 1-factorable multigraphs (Q2563511):
Displaying 20 items.
- A note on total and list edge-colouring of graphs of tree-width 3 (Q293637) (← links)
- Jacobsthal numbers in generalised Petersen graphs (Q322296) (← links)
- On two generalizations of the Alon-Tarsi polynomial method (Q651032) (← links)
- Proof of the list edge coloring conjecture for complete graphs of prime degree (Q743657) (← links)
- Graph polynomials and paintability of plane graphs (Q833000) (← links)
- Pfaffian labelings and signs of edge colorings (Q949785) (← links)
- Some results on \((a:b)\)-choosability (Q1025484) (← links)
- Computing the list chromatic index of graphs (Q1711669) (← links)
- Choosability, edge choosability and total choosability of outerplane graphs (Q1840829) (← links)
- Note on 3-choosability of planar graphs with maximum degree 4 (Q2324500) (← links)
- The list-chromatic index of \(K_6\) (Q2436826) (← links)
- Edge-coloring almost bipartite multigraphs (Q2444912) (← links)
- Parity, Eulerian subgraphs and the Tutte polynomial (Q2483482) (← links)
- Jacobsthal Numbers in Generalized Petersen Graphs (Q2958204) (← links)
- Total choosability of multicircuits II (Q4537555) (← links)
- Two Chromatic Conjectures: One for Vertices and One for Edges (Q5506782) (← links)
- COLORING ALGORITHMS ON SUBCUBIC GRAPHS (Q5696963) (← links)
- List Ramsey numbers (Q6055384) (← links)
- Transformation invariance in the combinatorial Nullstellensatz and nowhere-zero points of non-singular matrices (Q6091814) (← links)
- Edge-colouring graphs with local list sizes (Q6187343) (← links)
