The following pages link to Sandi Klavžar (Q251101):
Displaying 50 items.
- Coloring Sierpiński graphs and Sierpiński gasket graphs (Q934297) (← links)
- Distance-balanced graphs (Q938213) (← links)
- On distance-balanced graphs (Q966128) (← links)
- The Clar formulas of a benzenoid system and the resonance graph (Q967298) (← links)
- On the remoteness function in median graphs (Q967439) (← links)
- The distinguishing chromatic number of Cartesian products of two complete graphs (Q973145) (← links)
- Maximum cardinality resonant sets and maximal alternating sets of hexagonal systems (Q980378) (← links)
- On the geodetic number and related metric sets in Cartesian product graphs (Q998436) (← links)
- The median function on graphs with bounded profiles (Q1005230) (← links)
- Cover-incomparability graphs of posets (Q1013992) (← links)
- The packing chromatic number of infinite product graphs (Q1024309) (← links)
- Vertex-, edge-, and total-colorings of Sierpiński-like graphs (Q1024467) (← links)
- Characterizing \(r\)-perfect codes in direct products of two and three cycles (Q1041710) (← links)
- Transitive, locally finite median graphs with finite blocks (Q1043799) (← links)
- Induced cycles in crossing graphs of median graphs (Q1045199) (← links)
- Intersection graphs of halflines and halfplanes (Q1106247) (← links)
- A convexity lemma and expansion procedures for bipartite graphs (Q1272768) (← links)
- Recognizing median graphs in subquadratic time (Q1285576) (← links)
- Recognizing graphs of acyclic cubical complexes (Q1302166) (← links)
- Dynamic programming and convex clustering (Q1314428) (← links)
- Strong products of Kneser graphs (Q1336712) (← links)
- On the chromatic number of the lexicographic product and the Cartesian sum of graphs (Q1339858) (← links)
- Absolute retracts of split graphs (Q1339865) (← links)
- Improved bounds for the chromatic number of the lexicographic product of graphs (Q1345197) (← links)
- On subgraphs of Cartesian product graphs (Q1349090) (← links)
- Clique-gated graphs (Q1356418) (← links)
- Distributed multicast routing in point-to-point networks (Q1362952) (← links)
- (Q1370432) (redirect page) (← links)
- \(Y\)-compatible and strict \(Y\)-compatible functions (Q1370434) (← links)
- Wiener number of vertex-weighted graphs and a chemical application (Q1377617) (← links)
- (Q1392806) (redirect page) (← links)
- The Szeged and the Wiener index of graphs (Q1392808) (← links)
- Quasi-median graphs, their generalizations, and tree-like equalities (Q1399693) (← links)
- Isometric embeddings of subdivided wheels in hypercubes (Q1402086) (← links)
- Computing graph invariants on rotagraphs using dynamic algorithm approach: The case of (2, 1)-colorings and independence numbers (Q1406039) (← links)
- Fast recognition algorithms for classes of partial cubes (Q1408812) (← links)
- Cubic inflation, mirror graphs, regular maps, and partial cubes (Q1422394) (← links)
- On median graphs and median grid graphs (Q1567686) (← links)
- On the fractional chromatic number and the lexicographic product of graphs (Q1584257) (← links)
- An Euler-type formula for median graphs (Q1584314) (← links)
- Distances in benzenoid systems: Further developments (Q1584454) (← links)
- On the fractional chromatic number, the chromatic number, and graph products (Q1598804) (← links)
- Graphs which locally mirror the hypercube structure (Q1606972) (← links)
- Wiener index of hexagonal systems (Q1610244) (← links)
- On the Frame-Stewart algorithm for the multi-peg Tower of Hanoi problem (Q1613371) (← links)
- Resonance graphs of catacondensed even ring systems are median (Q1613516) (← links)
- Embeddings into almost self-centered graphs of given radius (Q1631688) (← links)
- Packing chromatic number versus chromatic and clique number (Q1647755) (← links)
- On the difference between the (revised) Szeged index and the Wiener index of cacti (Q1671315) (← links)
- Partition distance in graphs (Q1703394) (← links)
