Pages that link to "Item:Q2424665"
From MaRDI portal
The following pages link to Planar graphs with \(\Delta =9\) are neighbor-distinguishing totally 12-colorable (Q2424665):
Displaying 10 items.
- Adjacent vertex distinguishing total coloring of planar graphs with maximum degree 8 (Q785813) (← links)
- A characterization for the neighbor-distinguishing total chromatic number of planar graphs with \(\varDelta = 13\) (Q1783617) (← links)
- Planar graphs are \(9/2\)-colorable (Q1791701) (← links)
- Neighbor product distinguishing total colorings of planar graphs with maximum degree at least ten (Q2042610) (← links)
- Strict neighbor-distinguishing total index of graphs (Q2131155) (← links)
- Adjacent vertex distinguishing total coloring in split graphs (Q2166305) (← links)
- Neighbor-distinguishing total coloring of planar graphs with maximum degree twelve (Q2292141) (← links)
- Adjacent vertex distinguishing total choosability of planar graphs with maximum degree at least 10 (Q2424800) (← links)
- Planar Graphs of Odd-Girth at Least 9 are Homomorphic to the Petersen Graph (Q3629463) (← links)
- Neighbor product distinguishing total coloring of planar graphs without 5-cycles (Q6661065) (← links)