The following pages link to Sandi Klavžar (Q251101):
Displaying 50 items.
- Cut method and Djoković-Winkler's relation (Q277477) (← links)
- Recognizing Hamming graphs in linear time and space (Q287143) (← links)
- Improved upper bounds on the domination number of graphs with minimum degree at least five (Q292247) (← links)
- Vertex and edge orbits of Fibonacci and Lucas cubes (Q295278) (← links)
- Edge-transitive products (Q295827) (← links)
- Complexity of the game domination problem (Q313955) (← links)
- Edge-transitive lexicographic and Cartesian products (Q339471) (← links)
- A new recurrence relation and related determinantal form for binomial type polynomial sequences (Q346869) (← links)
- Sierpiński graphs as spanning subgraphs of Hanoi graphs (Q352716) (← links)
- On the difference between the revised Szeged index and the Wiener index (Q400395) (← links)
- Asymptotic properties of Fibonacci cubes and Lucas cubes (Q404538) (← links)
- A characterization of 1-cycle resonant graphs among bipartite 2-connected plane graphs (Q423951) (← links)
- Parity index of binary words and powers of prime words (Q456389) (← links)
- Dominating induced matchings for \(P_7\)-free graphs in linear time (Q476446) (← links)
- Total version of the domination game (Q497340) (← links)
- On isomorphism classes of generalized Fibonacci cubes (Q499490) (← links)
- Dominating sequences in grid-like and toroidal graphs (Q504964) (← links)
- Packing chromatic number, \((1, 1, 2, 2)\)-colorings, and characterizing the Petersen graph (Q509625) (← links)
- (Total) domination in prisms (Q510330) (← links)
- Packing chromatic number under local changes in a graph (Q512610) (← links)
- Almost-peripheral graphs (Q514683) (← links)
- A survey and classification of Sierpiński-type graphs (Q516890) (← links)
- Graphs that are simultaneously efficient open domination and efficient closed domination graphs (Q516892) (← links)
- How long can one bluff in the domination game? (Q521751) (← links)
- The Fibonacci dimension of a graph (Q540035) (← links)
- The b-chromatic number of cubic graphs (Q604658) (← links)
- On the domination number and the 2-packing number of Fibonacci cubes and Lucas cubes (Q639084) (← links)
- Asymptotic number of isometric generalized Fibonacci cubes (Q658005) (← links)
- Generalized Fibonacci cubes (Q658012) (← links)
- Characterizing almost-median graphs. II. (Q658076) (← links)
- On idomatic partitions of direct products of complete graphs (Q659730) (← links)
- Convex sets in lexicographic products of graphs (Q659762) (← links)
- Cube polynomial of Fibonacci and Lucas cubes (Q663441) (← links)
- Retracts of strong products of graphs (Q686295) (← links)
- Two remarks on retracts of graph products (Q686296) (← links)
- Hamming dimension of a graph-the case of Sierpiński graphs (Q691596) (← links)
- The index of a binary word (Q714791) (← links)
- Strong geodetic problem in grid-like architectures (Q723639) (← links)
- Hanoi graphs and some classical numbers (Q813952) (← links)
- Comparing Wiener complexity with eccentric complexity (Q827592) (← links)
- Cartesian powers of graphs can be distinguished by two labels (Q854831) (← links)
- Counting hypercubes in hypercubes (Q860462) (← links)
- On integer domination in graphs and Vizing-like problems (Q861441) (← links)
- On cube-free median graphs (Q864119) (← links)
- An almost complete description of perfect codes in direct products of cycles (Q864867) (← links)
- Partial cubes and their \(\tau\)-graphs (Q875040) (← links)
- Hamming polynomials and their partial derivatives (Q875053) (← links)
- Maximal proper subgraphs of median graphs (Q878630) (← links)
- Dominating direct products of graphs (Q879339) (← links)
- Domination game critical graphs (Q891326) (← links)
