Pages that link to "Item:Q2007724"
From MaRDI portal
The following pages link to The graph tessellation cover number: chromatic bounds, efficient algorithms and hardness (Q2007724):
Displayed 5 items.
- Total tessellation cover: bounds, hardness, and applications (Q2091795) (← links)
- A computational complexity comparative study of graph tessellation problems (Q2222093) (← links)
- Implementation of quantum walks on IBM quantum computers (Q2684259) (← links)
- Walking on vertices and edges by continuous-time quantum walk (Q2693842) (← links)
- (Q5020600) (← links)