My manuscripts:
-
Mapping planar graphs into the Coxeter graph (with H. Ararat, M. Petrusevski, N. Reza, Q. Sun),
Discrete Math. 339 (2016), no. 2, 839-849.
-
Some remarks on Wiener index of oriented graphs (with M. Knor, A. Tepeh), Appl. Math. Comput. 273 (2016), 631-636.
-
An inequality between the edge-Wiener index and the Wiener index of a graph (with M. Knor, A. Tepeh),
Appl. Math. Comput. 269 (2015), 714-721.
-
Rooted level-disjoint partitions of Cartesian products (with V. Vukasinovic, P. Gregor),
Appl. Math. Comput. 266 (2015), 244-258.
-
Comparing the irregularity and the total irregularity of graphs (with D. Dimitrov),
Ars Math. Contemp. 9 (2015), no. 1, 45-50.
-
Centralization of transmission in networks (with M. Krnc), Discrete Math. 338 (2015), no. 12, 2412-2420.
-
On diameter of nanotubical fullerene graphs (with V. Andova, F. Kardos, D. Blenkus, T. Doslic),
MATCH Commun. Math. Comput. Chem. 73 (2015), no. 2, 529-542.
-
Balaban index of cubic graphs (with M. Knor, A. Tepeh),
MATCH Commun. Math. Comput. Chem. 73 (2015), no. 2, 519-528.
-
Sandwiching saturation number of fullerene graphs (with V. Andova, F. Kardos),
MATCH Commun. Math. Comput. Chem. 73 (2015), no. 2, 501-518.
-
l-facial edge colorings of graphs (with B. Luzar, M. Moskovciakova, R. Sotak, P. Sugerek), Discrete Appl. Math. 181 (2015), 193-200.
-
Sandwiching the (generalized) Randić index (with M. Knor, B. Luzar), Discrete Appl. Math. 181 (2015), 160-166.
-
Rooted level-disjoint partitions of Cartesian products (with P. Gregor, V. Vukasinovic), Appl. Math. Comput. 266 (2015), 244-258.
-
Wiener index of line graphs. Quantitative graph theory (with Knor, Martin), 279-301, Discrete Math. Appl. (Boca Raton), CRC Press, Boca Raton, FL, 2015.
-
Group centralization of network indices (with M. Krnc), Discrete Appl. Math. 186 (2015), 147-157.
-
Counterexamples to a conjecture on injective colorings (with B. Luzar), Ars Math. Contemp. 8 (2015), no. 2, 291-295.
-
Modeling acquaintance networks based on balance theory (with V. Vukasinovic, J. Silc),
Int. J. Appl. Math. Comput. Sci. 24 (2014), no. 3, 683–696.
-
A congruence relation for the Wiener index of graphs with a tree-like structure (with K. Hrinakova, M. Knor, A. Tepeh),
MATCH Commun. Math. Comput. Chem. 72 (2014), no. 3, 791-806.
-
Trees T satisfying W(L^3(T)) = W(T) (with M. Knor, M. Macaj, P. Potocnik), Filomat 28 (2014), no. 3, 551-556.
-
On the connectivity of Cartesian product of graphs (J. Govorcin), Ars Math. Contemp. 7 (2014) 293-297.
-
Choosability of the square of a planar graph with maximum degree four (with Dan Cranston, Rok Erman),
59 (2014) 86-97.
-
Wiener index of generalized 4-stars and of their quadratic line graphs, (with M. Knor),
Australasian J. Combin. 58(1) (2014), Pages 119-26.
-
Vertex Version of the Wiener Theorem (with I. Gutman), MATCH Commun. Math. Comput. Chem. 72 (2014) 295-300.
-
Complete solution of equation W(L^3(T))=W(T) for Wiener index of iterated line graphs of trees
(with M. Knor, P. Potocnik), Discrete Appl. Math. 171 (2014), 90-103.
-
On Wiener Index of Common Neighborhood Graphs (with M. Knor, B. Luzar, I. Gutman), MATCH Commun. Math. Comput. Chem. 72 (2014) 321-332.
-
Strong edge coloring of planar graphs (with D. Hudak, B. Luzar, R. Sotak), Discrete Math. 324 (2014), 41-49.
-
Relationship between edge-Wiener index and Gutman index of a graph (with M. Knor, P. Potocnik),
Discrete Appl. Math. 167 (2014), 197-201.
-
Sufficient sparseness conditions for G^2 to be (Delta + 1)-choosable, when
Delta>= 5 (with D. Cranston), Discrete Applied Math 162 (2014), 167-176.
-
Strong parity vertex coloring of plane graphs (with T. Kaiser, O. Rucky, and M. Stehlik),
Discrete Math. Theor. Comput. Sci. 16 (2014), 143-158.
-
Replication in critical graphs and the persistence of monomial ideals
(with T. Kaiser and M. Stehlik) J. Combin. Theory Ser. A 123 (2014), 239-251.
-
Some Results on Zagreb Indices (with V. Andova, and D. Dimitrov), book chapter,
I. Gutman(ed.) Topics in Chemical Graph Theory 21-38(2014).
-
Fullerene Graphs and Some Relevant Graph Invariants (with V. Andova, F. Kardos),
book chapter, Fullerene Graph and Some relevant Graph Invariants, I Gutman (ed.)
Topic in Chemical Graph Theory 39-54(2014).
-
Euler's idoneal numbers and an inequality concerning minimal graphs with a prescribed number of spanning
trees (with J. Azarija), Math Bohemica 138 (2013) 121ñ131.
-
Improved bound on facial parity edge coloring (with B. Luzar) Discrete Math. 313 (2013) 2218-2222.
-
Deterministic self-similar models of complex networks based on very
symmetric graphs (with M. Knor), Physica A 392 (2013) 4629ñ4637.
-
On the connectivity of Cartesian product of two graphs (with J. Govorcin), Ars Math. Contemp. 7 (2014) 293-297.
-
On the mutually independent Hamiltonian cycles in faulty hypercubes (with V. Vukasinovic, P. Gregor),
Information Sciences 236 (2013) 224-235.
-
On a variation of Randic index (with V. Andova, M. Knor, P. Potocnik), Australas. J. Combinatorics. 56 (2013) 61-76.
-
Line graph operator and small worlds (with J. Govorcin, M. Knor), Inform. Process. Lett. 113 (2013) 196-200.
-
Wiener index of iterated line graphs of trees homeomorphic to the claw K_1,3
(with M. Knor, P. Potocnik), Ars Math. Contemp. 6 (2013) 211-219.
-
Wiener index of iterated line graphs of trees homeomorphic to H (with M. Knor, P. Potocnik),
Discrete Math. 313 (2013) 1104-1111.
-
A bound on the number of perfect matchings in klee-graphs (with M. Cygan, M. Pilipczuk),
Discrete Math. Theor. Comput. Sci. 15 (2013) 37-52.
-
Diameter of full icosahedral-symmetry fullerene graphs (with V. Andova),
MATCH Commun. Math. Comput. Chem. 70 (2013) 205-220.
-
Some results on Vizing's conjecture and related problems
(with Marcin Pilipczuk, Michael Pilipczuk), Discrete Appl. Math. 160 (2012) 2484-2490.
- On the inequality between radius and Randic index for graphs
(with M. Cygan, M. Pilipczuk), MATCH Commun. Math. Comput. Chem. 67 (2012) 451-466.
-
Queue layouts of hypercubes (P. Gregor, V. Vukasinovic), SIAM J. Discrete Math. 26 (2012) 77-88.
-
Wiener index in iterated line graphs (with M. Knor, P. Potocnik), Discrete Appl. Math. 160 (2012) 2234-2245.
-
Some remarks on inverse Wiener index problem (with J. Fink, B. Luûar), Discrete Appl. Math.
160 (2012) 1851-1858.
-
Acyclic edge coloring of planar graphs with Delta colors
(with D. Hudak, F. Kardos, B. Luzar, R. Sotak), Discrete Applied Mathematics 160 (2012) 1356-1368.
-
Bipartizing fullerenes (with Z. Dvorak, B. Lidicky), Eur. J. Comb. 33 (2012) 1286-1293.
-
Parity vertex colorings of binomial trees (with P. Gregor),
Discuss. Math. Graph Theory 32 (2012) 177-180.
-
A note on Zagreb indices inequality for graphs with few cycles (with C. Nathann, V. Andova),
Ars Math. Contemp. 5 (2012) 73-76.
-
On the diameter and some related invariants of fullerene graphs (with V. Andova, T. Doslic, M. Krnc, B. Luzar),
MATCH Commun. Math. Comput. Chem. 68 (2012) 109ñ130.
-
Brooks theorem for dart graphs (with M. Kochol), Inform. Proc. Letters 112 (2012) 200-204.
-
On a conjecture about Wiener index in iterated line graphs of trees
(with M. Knor, P. Potocnik), Discrete Math. 312 (2012) 1094-1105.
-
Hyperbolic analogues of fullerenes on orienatable surfaces (with M. Knor,
P. Potocnik, J. Siran), Discrete Math. 312 (2012) 729-736.
-
Bounds on Gutman index (with V. Andova, D. Dimitrov, J. Fink), MATCH Commun. Math. Comput. Chem. 67 (2012) 515-524.
-
Relation between Randic index and average distance of trees
(with M. Cygan, M. Pilipczuk), MATCH Commun. Math. Comput. Chem. 66 (2011) 605-612.
-
Graphs with Two Crossings Are 5-Choosable (with Z. Dvorak, B. Lidicky),
SIAM J. Discrete Math. 25 (2011) 1746-1753.
-
Graphs with odd cycle lengths 5 and 7 are 3-colorable (with T.Kaiser, O.Rutckey),
SIAM J. Discrete Math. 25 (2011) 1069-1088.
-
On the 2-resonance of fullerenes (with T. Kaiser, M. Stehlik),
SIAM J. Discrete Math. 25 (2011) 1737-1745.
-
Randic index and the diameter of a graph (with Z. Dvorak, B. Lidicky),
European J. Comb. 32 (2011) 434-442.
-
On the Zagreb index inequality of graphs with prescribed
vertex degrees (with V. Andova, S. Bogoev, D. Dimitrov, M. Pilipczuk),
Discrete Applied Math. 159 (2011) 852-858.
-
Contour map patterns (with S. Puc). J. Mathematics and the Arts 5 5 (2011) 129-140.
-
Some classes of graphs (dis)satisfying the Zagreb indices inequality (with V. Andova, N. Cohen),
MATCH Commun. Math. Comput. Chem. 65 (2011) 647-658.
-
3-choosability of triangle-free planar graphs with constraint on 4-cycles
(with Z. Dvorak, B. Lidicky), SIAM J. Discrete Math. 24 (2010) 934ñ-945.
-
Cyclic 7-edge-cuts in fullerene graphs (with F. Kardos, M. Krnc, B. Luzar),
J. Math. Chemistry 47 (2010) 771-789.
-
Gray code compression, (with D. Dimtrov, T. Dvorak and P. Gregor),
. Eur. J. Comb. 34 (2013) 69-81.
-
On Wiener index of graphs and their line graphs (with N. Cohen, D. Dimitrov, R. Krakovski, V. Vukasinovic),
MATCH Commun. Math. Comput. Chem. 64 2010) 683-698.
- Non-rainbow colorings of 3-, 4- and 5-connected plane graphs
(with Z. Dvorak, D. Kral), J. Graph Theory. 63 (2010) 129-145.
-
On Generalized Middle Level Problem (with P. Gregor), Inform. Science 180 (2010) 2448-2457.
-
An improved linear bound on the number of perfect matchings in cubic graphs
(with L. Esperet, D. Kral, P. Skoda), European J. Comb. 31 (2010) 1316-1334.
- Facial colorings using Hall's Theorem
(with F. Havet, D. Kr·l', J.-S. Sereni), European J. Combin. 31 (2010) 1001-1019.
- Backbone colorings of graphs with bounded degree
(with J. Miskuf, M. Tancer), Discrete Applied Math. 158 (2010) 534-542.
-
An improved bound on the largest induced forests for
triangle-free planar graphs (with B. Luzar, L.Kowalik), Discrete Math. Theor. Comput. Sci. 12 (2010) 87-100.
- Injective colorings of planar graphs with few colors
(with B. Luzar and M. Tancer), Discrete Math. 309 (2009) 5636-5649.
-
Planar graphs without 3-,7-, and 8-cycles are 3-choosable(with Z. Dvo¯·k, B. Lidick˝),
Discrete Math. 309 (2009) 5899-5904.
- Backbone Colorings and generalized Mycielski Graphs
(with J. Miskuf, M. Tancer), SIAM J. Discrete Math. 23 (2009) 1063-1070.
- Gray codes faulting matchings
(with D. Dimtrov, T. Dvorak and P. Gregor), Discrete Math. Theor. Comput. Sci. 11 (2009) 123-147.
- Homomorphisms of triangle-free graphs without a K_5-minor,
(with R. Naserasr and Y. Nigussie), Discrete Math 309 (2009) 5789-5798.
- Distance constrained labelings of planar graph with no short cycles,
(with Z. Dvorak, D. Kral, P. Nejedly), Discrete Applied Math. 157 (2009) 2634-2645.
-
Long cycles in hypercubes with distant faulty vertices (with P. Gregor),
Discrete Math. Theor. Comput. Sci. 11 (2009) 185-198.
- k-chromatic number of graphs on surfaces
(with Z. Dvorak), SIAM J. Discrete Math. 23 (2009) 477-486.
- Long cycles in fullerene graphs
(with D. Kral, O. Pankrac, J.-S. Sereni), Journal Math. Chemistry 45 (2009) 1021-1031.
- Total-couloring of planar graphs with maximum degree nine
(with L. Kowalik, J.S. Sereni), SIAM J. Discrete Math. 22 (2008) 1462-1479.
- Coloring squares of planar graphs with girth six
(with Z. Dvorak, D. Kral, P. Nejedly), European J. Combin, 22 (2008) 838-849.
- Cycles intersects edge-cuts of prescibed sizes (with T. Kaiser),
SIAM J. Discrete Math. 22 (2008) 861-874.
- Cyclic k-edge-cuts in fullerene graphs
(with F. Kardos), Journal Math. Chemistry 22 (2008) 121-132.
- Planar graphs of odd-girth at least 9 are homomorphic to
Petersen graph (with Z. Dvorak, T. Valla), SIAM J. Discrete Math. 22 (2008) 568-591.
- 3-Facial colouring of plane graphs (with F. Havet, J.S. Sereni),
SIAM J. Discrete Math., 22 (2008) 231-247.
- List-Colouring Squares of Sparse Subcubic Graphs,
(with Z. Dvorak and M. Tancer), SIAM J. Discrete Math. 22 (2008) 139-159.
- Cyclic, facial, and diagonal colorings -- a missing case (with D. Kral and T. Madaras),
European J. Combin., 28 (2007) 1637-1639.
- T-joins intersecting small edge-cuts in graphs,
(with T. Kaiser), J. Graph Theory, 56 (2007) 64-71.
- A Generalization of Kotzig's Theorem and its Application,
(with R. Cole, L. Kowalik), SIAM J. Discrete Math., 21 (2007) 93-106.
- Circular chromatic index of graphs with high girth,
(with T. Kaiser, D. Kral, X. Zhu), J. Combin. Theory Ser. B 97 (2007) 1-13.
- The 7-cycle C7 is light in the class of planar graph of
minimum degree five (with T. Madaras and H.-J. Voss), Discrete Math. 307
(2007) 1430-1435.
- Lightness, Heaviness and Gravity (with T. Madaras),
Discrete Math. 307 (2007) 939-951.
- On the cube-free median graphs (with B. Bresar and S. Klavzar),
Discrete Math., 307 (2007) 345-351.
- Four gravity results (with Z. Dvorak and T. Valla),
Discrete Math. 307 (2007) 181-190.
- Colorings of Plane Graphs with no Rainbow Faces (with V. Jungic and D. Kral),
Combinatorica 26 (2006) 169-182.
- Construction of large graphs with no optimal surjective
L(2,1)-labelings (with D. Kral and M. Tancer),
SIAM J. Discrete Math. 20 (2006) 536-543.
- A theorem about a contractible and light edge, (with Z. Dvorak),
SIAM J. Discrete Math. 20 (2006) 55-61.
- Roots of cube polynomial of median graphs (with B. Bresar and S. Klavzar),
J. Graph Theory 52 (2006) 37-50.
- The last excluded case of Dirac's Map-Color Theorem for Choosability,
(with D. Kral), J. Graph Theory 51 (2006) 319-354.
- A Map Colour Theorem for the Union of Graphs (with M. Stiebitz),
J. Combin. Theory Ser. B 96 (2006) 20-37.
- A Brooks-type theorem for the Generalized List T-colorings,
(with J. Fiala and D. Kral), SIAM J. Discrete Math. 18 (2005) 588-609.
- Nowherezero 3-flows in abelian Cayley graphs (with P. Potocnik and M. Skoviera),
Discrete Math. 297 (2005) 119-127.
- Nordhaus-Gaddum-type theorems for decompositions into many parts
(with Z. Furedi, A. Kostochka, M. Stiebitz, D. West), J. Graph Theory
50 (2005) 273-292.
- Generalized list distance labelings of cycles (with J. Fiala),
Discrete Appl. Math., 148 (2005) 13-25.
- Cyclic, facial, and diagonal colorings (with D. Kral and T. Madaras),
European J. Combin., 26 (2005) 473-490.
- Coloring face hypergraphs of graphs on surfaces (with Z. Dvorak and
D. Kral), European J. Combin 26 (2005) 95-110.
-
Borodin's Conjecture about 1-diagonal colorings is false (with D. Kral),
European J. Combin. 25 (2004) 813-816.
- A Revival of the Girth Conjecture (with T. Kaiser and D. Kral),
J. Combin. Theory Ser. B 98 (2004) 41-53.
-
Heavy paths, light stars, and big melons (with T. Madaras),
Discrete Math., 286 115-131.
- Planar graph colorings without short monochromatic cycles (with T. Kaiser),
J. Graph Theory, 46 (2004) 25-38.
-
Subdivisions of large complete bipartite graphs and long induced paths in
k-connected graphs (with T. Bohme, B. Mohar, M. Stiebitz),
J. Graph Theory 45 (2004) 270-274.
-
Light subgraphs in planar graphs of minimum degre 4 and edge-degree 9
(with B. Mohar and J.-H. Voss), J. Graph Theory, 44 (2003) 261-295.
-
Hajos' Theorem for list-colorings of hypergraphs (with C. Benzaken and
S. Gravier), Discuss. Math. Graph Theory, 23 (2003) 207-213.
-
A theorem about the channel assignment problem (with D. Kral),
SIAM J. Discrete Math. 16 (2003) 426-437.
- Quasi-median graphs, their generalizations, and tree-like equalities
(with B. Bresar and S. Klavzar), European J. Combin. 24 (2003) 557-572.
-
Coloring the clique hypergraph of graphs without forbidden structure (with S. Gravier),
Preprint Ser. IMFM (2003) PS-890.
-
The Petersen graph is not 3-edge-colorable - a new proof
(with R. Naserasr), Discrete Math. 268 (2003) 325-326.
-
A theorem on integer flows on Cartesian products of graphs (with W. Imrich),
J. Graph Theory 43 (2003) 93-98.
- The cube polynomial (with B. Bresar and S. Klavzar), Electron. J. Combin.
10 R3 (2003) 1-11.
- Planar graphs without cycles of specific lengths (with
G. Fijavz, M. Juvan, and B. Mohar), European J. Combin. 23 (2002) 377-388.
- Tiled partial cubes, (with B. Bresar, W. Imrich, S. Klavzar, and H. M. Mulder),
J. Graph Theory 40 (2002) 91-103.
- A theorem on map colorings, Bull. Inst. Combin. Appl. 35 (2002) 53-60.
- On the ciritcal point-arboricity graphs, J. Graph Theory
39 (2002) 50-61.
- Gallai's innequality for critical graphs of reducible hereditary
properties (with P. Mihok), Discuss. Math. Graph Theory
21 (2001) 167-177.
- Nowhere-zero k-flows of supergraphs (with B. Mohar),
Electron. J. Combin. 8 (2001) R20, 1-10.
- A note on choosability with separation for planar graphs,
Ars Combinatoria 58 (2001) 169-174.
- Two relations about median graphs, Discrete Math. 226 (2001) 351-353.
- Square-edge graphs, (with S. Klavzar and A. Vesel),
Bull. Inst. Combin. Appl. 30 (2000) 67-78.
- On median graphs and median grid graphs (with S. Klavzar), Discrete Math.
219 (2000) 287-293.
- List improper colorings of planar graphs with prescribed girth,
Discrete Math. 214 (1999) 221-226.
- A Grotzsch-type theorem for list colorings with impropriety one,
Combin. Probab. and Comput. 8 (1999) 493-507.
- List improper colorings of planar graphs, Combin. Probab. and Comput.
8 (1999) 293-299.
- Graphs of degree 4 are 5-edge-choosable
(with M. Juvan and B. Mohar), J. Graph Theory 32 (1999) 250-264.
- The Grotzsch Theorem for the hypergraph of maximal cliques (with B. Mohar),
Electronic Journal of Combinatorics 6 (1) (1999) R26 1-13.
- List total colourings of graphs
(with M. Juvan and B. Mohar), Combin. Probab. and Comput.
7 (1998) 181-188.
- On list edge-colorings of cubic graphs (with M. Juvan and B. Mohar),
Discrete Math. 187 (1998) 137-149.
- Choosability of K5-minor-free graphs, Discrete Math.
190 (1998) 223-226.
- An Euler-type formula for median graphs
(with S. Klavzar and H.M. Mulder), Discrete Math.
187 (1998) 255-258.
Last modified: 25. 9. 2011