Pages that link to "Item:Q1686009"
From MaRDI portal
The following pages link to Every signed planar graph without cycles of length from 4 to 8 is 3-colorable (Q1686009):
Displaying 7 items.
- Choosability in signed planar graphs (Q896077) (← links)
- Concepts of signed graph coloring (Q2225432) (← links)
- The relative signed clique number of planar graphs is 8 (Q2326575) (← links)
- Alon-Tarsi number and modulo Alon-Tarsi number of signed graphs (Q2334069) (← 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)