Pages that link to "Item:Q658035"
From MaRDI portal
The following pages link to Simpler multicoloring of triangle-free hexagonal graphs (Q658035):
Displaying 5 items.
- A linear time algorithm for \(7\)-\([3]\)coloring triangle-free hexagonal graphs (Q436606) (← links)
- Maximum induced matching of hexagonal graphs (Q726519) (← links)
- A technique for multicoloring triangle-free hexagonal graphs (Q2570123) (← links)
- 3-path vertex cover and dissociation number of hexagonal graphs (Q5866250) (← links)
- Channel assignment and multicolouring of the induced subgraphs of the triangular lattice (Q5936032) (← links)
