Pages that link to "Item:Q2284741"
From MaRDI portal
The following pages link to A refinement of choosability of graphs (Q2284741):
Displaying 28 items.
- Choosability in signed planar graphs (Q896077) (← links)
- An upper bound on adaptable choosability of graphs (Q1003583) (← links)
- Strict refinement for graphs and digraphs (Q1072575) (← links)
- The best choice problem for upward directed graphs (Q1926501) (← links)
- Circular chromatic number of signed graphs (Q2034071) (← links)
- Complex and homomorphic chromatic number of signed planar simple graphs (Q2117521) (← links)
- Generalized signed graphs of large girth and large chromatic number (Q2144578) (← links)
- The Alon-Tarsi number of a planar graph minus a matching (Q2200936) (← links)
- On the 4-color theorem for signed graphs (Q2225420) (← links)
- Concepts of signed graph coloring (Q2225432) (← links)
- Colouring of \(S\)-labelled planar graphs (Q2225437) (← links)
- Incidence choosability of graphs (Q2312648) (← links)
- An algebraic criterion for the choosability of graphs (Q2345516) (← links)
- (\(1,\lambda\))-embedded graphs and the acyclic edge choosability (Q2890349) (← links)
- (Q2936690) (← links)
- (Q3073570) (← links)
- (Q3094531) (← links)
- On the acyclic choosability of graphs (Q5469027) (← links)
- (Q5741893) (← links)
- Choosability conjectures and multicircuits (Q5948972) (← links)
- Flexible list colorings in graphs with special degeneracy conditions (Q6046649) (← links)
- Chromatic λ‐choosable and λ‐paintable graphs (Q6056763) (← links)
- Signed colouring and list colouring of k‐chromatic graphs (Q6057660) (← links)
- Flexible List Colorings in Graphs with Special Degeneracy Conditions (Q6065433) (← links)
- Girth and λ $\lambda $‐choosability of graphs (Q6074593) (← links)
- List 4-colouring of planar graphs (Q6170786) (← links)
- Refined List Version of Hadwiger’s Conjecture (Q6171265) (← links)
- Complexity of near-3-choosability problem (Q6632143) (← links)
