Brešar, Boštjan.
Brešar, Boštjan, 19..-....
Boštjan Brešar Slovene mathematician
VIAF ID: 45152380038501760241 ( Personal )
Permalink: http://viaf.org/viaf/45152380038501760241
Preferred Forms
- 100 0 _ ‡a Boštjan Brešar ‡c Slovene mathematician
-
-
- 100 1 _ ‡a Brešar, Boštjan
- 100 1 _ ‡a Brešar, Boštjan
- 100 1 _ ‡a Brešar, Boštjan, ‡d 19..-....
-
-
- 100 1 _ ‡a Brešar, Boštjan
- 100 1 _ ‡a Brešar, Boštjan
-
4xx's: Alternate Name Forms (9)
5xx's: Related Names (2)
Works
Title | Sources |
---|---|
1-perfectly orientable K[sub]4-minor-free and outerplanar graphs | |
Analiza | |
Book of Abstracts | |
Bucolic complexes | |
Bukolični kompleksi. | |
The competition-independence game with prevention | |
Cover-incomparability graphs of posets | |
Crossing graphs of fiber-complemented graphs | |
Cube intersection concepts in median graphs | |
Cubes polynomial and its derivatives | |
Cubic inflation, mirror graphs, regular maps, and partial cubes | |
Dominating sequences and related graph invariants | |
Domination games played on graphs | |
Edge-connectivity of strong products of graphs | |
Fast recognition algorithms for classes of partial cubes | |
A generalization of Hungarian method and Hall's theorem with applications in wireless sensor networks | |
The geodetic number of the lexicographic product of graphs | |
Graphs that are critical for the packing chromatic number | |
Graphs with a unique maximum open packing | |
Hitri prepoznavni algoritmi za razrede delnih kock. | |
How long can one bluff in the domination game? | |
Igra dominacije na drevesih in vpetih podgrafih. | |
Kubična napihovanja, zrcalni grafi, regularni zemljevidi in delne kocke. | |
Kvazi medianski grafi, njihove posplošitve in drevesne enakosti. | |
LL 30 | |
Mavrična dominacija v grafih. | |
Median and quasi-median direct products of graphs | |
O medianskih grafih brez 3-kocke. | |
Neskončna družina podkubičnih grafov z neomejenim pakirnim kromatičnim številom. | |
On partial cubes and graphs with convex intervals | |
On subgraphs of Cartesian product graphs and S-primeness | |
On the chromatic edge stability index of graphs | |
On the natural imprint function of a graph | |
Packing coloring of Sierpiński-type graphs | |
Pakirna barvanja podkubičnih zunanje ravninskih grafov. | |
Pakirno kromatično število proti kličnemu številu. | |
Quasi-matchings in bipartite graphs | |
Quasi-median graphs, their generalizations, and tree-like equalities | |
Računanje medianskih in antimedianskih množic v medianskih grafih. | |
Raznoterost dominacijskih iger. | |
Reconstructing subgraph-counting graph polynomials of increasing families of graphs | |
Rekonstrukcija podgrafovsko-preštevalnih polinomov za naraščajoče družine grafov. | |
The relational expansion on graphs | |
Resolution of some optimisation problems on graphs and combinatorial games | |
Retracts of products of chordal graphs | |
Roots of cube polynomials of median graphs | |
Scheide, Diego(D-ILTU-IM); Stiebitz, Michael(D-ILTU-IM): Vizing's coloring algorithm and the fan number. (English summary). - J. Graph Theory 65 (2010), no. 2, 115-138 | |
Seznamska barvanja grafov : diplomska seminarska naloga | |
Simultaneous embeddings of graphs as median and antimedian subgraphs | |
Sodobne igre barvanj in sorodne igre na grafih : doktorska disertacija | |
Spodnje (celotno) število vzajemne vidljivosti v grafih. | |
Square-free colorings of graphs | |
Steiner intervals, geodesic intervals, and betweenness | |
Steinerjevi intervali, geodetski intervali in vmesnost. | |
Strukturne in algebraične lastnosti razredov grafov : zaključno poročilo o rezultatih raziskovalnega projekta v letu 2004 | |
Taletskii, D. S. (RS-HSE2); Malyshev, D. S. (RS-HSE2): The number of maximal independent sets in trees with a given number of leaves. (English summary). - Discrete Appl. Math. 314 (2022), 321–330. | |
Teorija grafov v srednješolskem izobraževanju = Graph theory in secondary education | |
[Theta]-graceful labelings of partial cubes | |
Tiled partial cubes and Euler-type formulas | |
Tlakovane delne kocke. | |
Toll convexity | |
Tree-like isometric subgraphs of hypercubes | |
Uniformly dissociated graphs | |
Večinska strategija na medianskih grafih : diplomsko delo | |
Vertex k-path cover of graphs | |
Vizing-like conjecture for the upper domination of Cartesian products of graphs - the proof | |
Vizingova domneva: pregled in novi rezultati. | |
Vizingova domneva za grafe z dominantnim številom 3 - nov dokaz. | |
Vizing's conjecture: a survey and recent results | |
Wang, Hong(1-ID): Packing two copies of a sparse graph into a graph with restrained maximum degree. (English summary). - J. Graph Theory 62 (2009), no. 2, 178-187 | |
Zadevanje podgrafov P[spodaj]4-urejenih grafov. | |
Zehavi, Meirav (IL-TECH-C): The k-leaf spanning tree problem admits a klam value of 39. (English summary). - European J. Combin. 68 (2018), 175-203 | |
Zhu, Zhongxun (PRC-SCUFN-CMS); Hong, Yunchao (PRC-SCUFN-CMS): Minimum degree distance among cacti with perfect matchings. (English summary). - Discrete Appl. Math. 205 (2016), 191-201 |