The following pages link to (Q3808118):
Displaying 18 items.
- The \(b\)-chromatic number of powers of hypercube (Q327695) (← links)
- Polynomial time recognition of squares of Ptolemaic graphs and 3-sun-free split graphs (Q497674) (← links)
- On \(b\)-coloring of powers of hypercubes (Q528557) (← links)
- Boxicity of leaf powers (Q659669) (← links)
- Structure and linear time recognition of 3-leaf powers (Q844175) (← links)
- The square of a block graph (Q965949) (← links)
- Characterising \((k,\ell )\)-leaf powers (Q968117) (← links)
- Chromatic sets of power graphs and their application to resource placement in multicomputer networks (Q980032) (← links)
- Simplicial powers of graphs (Q1040586) (← links)
- Distances in cocomparability graphs and their powers (Q1183347) (← links)
- Powers of geometric intersection graphs and dispersion algorithms (Q1414578) (← links)
- Perfect elimination orderings of chordal powers of graphs (Q1815326) (← links)
- Powers of distance-hereditary graphs (Q1901030) (← links)
- On powers of \(m\)-trapezoid graphs (Q1902905) (← links)
- A good characterization of squares of strongly chordal split graphs (Q1944051) (← links)
- Complexity of finding graph roots with girth conditions (Q2428666) (← links)
- Strongly simplicial vertices of powers of trees (Q2455590) (← links)
- Structural properties of word representable graphs (Q2630778) (← links)
