Pages that link to "Item:Q896077"
From MaRDI portal
The following pages link to Choosability in signed planar graphs (Q896077):
Displaying 17 items.
- Degree choosable signed graphs (Q512558) (← links)
- Path choosability of planar graphs (Q1627209) (← links)
- Every signed planar graph without cycles of length from 4 to 8 is 3-colorable (Q1686009) (← links)
- A sufficient condition for DP-4-colorability (Q1752670) (← links)
- Choosability of planar graphs (Q1916256) (← links)
- Planar graphs without 4-cycles adjacent to triangles are DP-4-colorable (Q2000565) (← links)
- Cover and variable degeneracy (Q2075519) (← links)
- Edge coloring of the signed generalized Petersen graph (Q2117562) (← links)
- A generalization of Noel-Reed-Wu theorem to signed graphs (Q2174577) (← links)
- Concepts of signed graph coloring (Q2225432) (← links)
- A refinement of choosability of graphs (Q2284741) (← links)
- Alon-Tarsi number and modulo Alon-Tarsi number of signed graphs (Q2334069) (← links)
- Hajós-like theorem for signed graphs (Q2408976) (← links)
- Planar graphs without intersecting 5-cycles are signed-4-choosable (Q5101876) (← links)
- Signed colouring and list colouring of k‐chromatic graphs (Q6057660) (← links)
- Separating signatures in signed planar graphs (Q6110620) (← links)
- Variable degeneracy on toroidal graphs (Q6143693) (← links)