Pages that link to "Item:Q1196681"
From MaRDI portal
The following pages link to Colorings and orientations of graphs (Q1196681):
Displayed 18 items.
- A relation between choosability and uniquely list colorability (Q2496207) (← links)
- List colourings of planar graphs. (Reprint) (Q2498006) (← links)
- List edge colourings of some 1-factorable multigraphs (Q2563511) (← links)
- A note on 3-choosability of planar graphs without certain cycles (Q2566160) (← links)
- A compactness argument in the additive theory and the polynomial method. (Q2575791) (← links)
- Choosability of toroidal graphs without short cycles (Q3055923) (← links)
- Expressing Combinatorial Problems by Systems of Polynomial Equations and Hilbert's Nullstellensatz (Q3552513) (← links)
- ADDITIVE BASES IN ABELIAN GROUPS (Q3578421) (← links)
- ON THE NUMBER OF LATIN RECTANGLES (Q3580003) (← links)
- Circular choosability via combinatorial Nullstellensatz (Q3605148) (← links)
- Weight choosability of graphs (Q3608322) (← links)
- The Dinitz problem solved for rectangles (Q4275683) (← links)
- Choice Numbers of Graphs: a Probabilistic Approach (Q4291205) (← links)
- Total choosability of multicircuits I (Q4537554) (← links)
- Total choosability of multicircuits II (Q4537555) (← links)
- Coloration de graphes : fondements et applications (Q4809665) (← links)
- Short Proof of Galvin's Theorem on the List-chromatic Index of a Bipartite Multigraph (Q4883064) (← links)
- Amenable colorings (Q5906786) (← links)