The following pages link to Boštjan Brešar (Q195154):
Displaying 50 items.
- Total dominating sequences in graphs (Q267175) (← links)
- Complexity of the game domination problem (Q313955) (← links)
- Bucolic complexes (Q392957) (← links)
- (Q406312) (redirect page) (← links)
- On the weighted \(k\)-path vertex cover problem (Q406316) (← links)
- A generalization of Hungarian method and Hall's theorem with applications in wireless sensor networks (Q412342) (← links)
- On Cartesian products having a minimum dominating set that is a box or a stairway (Q497315) (← 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)
- 1-perfectly orientable \(K_{4}\)-minor-free and outerplanar graphs (Q510581) (← links)
- Packing chromatic number under local changes in a graph (Q512610) (← links)
- Cover-incomparability graphs and 2-colored diagrams of posets (Q514748) (← links)
- Cover-incomparability graphs and chordal graphs (Q602752) (← links)
- On a local 3-Steiner convexity (Q648980) (← links)
- Dominating sequences in graphs (Q740654) (← links)
- A \(\frac{3}{4}\)-approximation of Vizing's conjecture for claw-free graphs (Q777412) (← links)
- On integer domination in graphs and Vizing-like problems (Q861441) (← links)
- On cube-free median graphs (Q864119) (← links)
- Characterizing almost-median graphs (Q872051) (← links)
- Hamming polynomials and their partial derivatives (Q875053) (← links)
- Maximal proper subgraphs of median graphs (Q878630) (← links)
- Dominating direct products of graphs (Q879339) (← links)
- Vizing's conjecture for graphs with domination number 3 -- a new proof (Q888596) (← links)
- Rainbow domination in graphs (Q928382) (← links)
- On the geodetic number of median graphs (Q941326) (← links)
- On the remoteness function in median graphs (Q967439) (← links)
- On the geodetic number and related metric sets in Cartesian product graphs (Q998436) (← links)
- Cover-incomparability graphs of posets (Q1013992) (← links)
- Cage-amalgamation graphs, a common generalization of chordal and median graphs (Q1024305) (← links)
- Cube intersection concepts in median graphs (Q1025912) (← links)
- Steiner intervals, geodesic intervals, and betweenness (Q1045107) (← links)
- (Q1297443) (redirect page) (← links)
- On clique-gated graphs (Q1297444) (← links)
- On the natural imprint function of a graph (Q1348742) (← links)
- The direct expansion of graphs (Q1349072) (← links)
- Quasi-median graphs, their generalizations, and tree-like equalities (Q1399693) (← links)
- Fast recognition algorithms for classes of partial cubes (Q1408812) (← links)
- On the independence graph of a graph (Q1412670) (← links)
- Cubic inflation, mirror graphs, regular maps, and partial cubes (Q1422394) (← links)
- Packing coloring of Sierpiński-type graphs (Q1621491) (← links)
- An infinite family of subcubic graphs with unbounded packing chromatic number (Q1637153) (← links)
- Packing chromatic number versus chromatic and clique number (Q1647755) (← links)
- On total domination in the Cartesian product of graphs (Q1656910) (← links)
- Total dominating sequences in trees, split graphs, and under modular decomposition (Q1662158) (← links)
- On the number of maximal independent sets in minimum colorings of split graphs (Q1671359) (← links)
- Domination parameters with number 2: interrelations and algorithmic consequences (Q1682877) (← links)
- Independence number of products of Kneser graphs (Q1727773) (← links)
- Convex and isometric domination of (weak) dominating pair graphs (Q1749540) (← links)
- Grundy dominating sequences and zero forcing sets (Q1751247) (← links)
- Almost self-centered median and chordal graphs (Q1758318) (← links)
