Pages that link to "Item:Q531605"
From MaRDI portal
The following pages link to Powers of cycles, powers of paths, and distance graphs (Q531605):
Displayed 11 items.
- A characterization of line graphs that are squares of graphs (Q400504) (← links)
- Biclique-colouring verification complexity and biclique-colouring power graphs (Q491598) (← links)
- On Hamiltonian paths in distance graphs (Q533446) (← links)
- Boxicity of circular arc graphs (Q659754) (← links)
- Graph classes with and without powers of bounded clique-width (Q896650) (← links)
- Computing square roots of trivially perfect and threshold graphs (Q2446337) (← links)
- Short Models for Unit Interval Graphs (Q2840545) (← links)
- Bounded, minimal, and short representations of unit interval and unit circular-arc graphs. Chapter I: theory (Q2985115) (← links)
- Bounded, minimal, and short representations of unit interval and unit circular-arc graphs. Chapter II: algorithms (Q2985116) (← links)
- Finding cut-vertices in the square roots of a graph (Q5915963) (← links)
- Short k‐radius sequences, k‐difference sequences and universal cycles (Q6187437) (← links)