5 citations · 8 across the 12 of their papers we have counts for
14 papers
Frugal coloring in planar graphs with maximum degree 4 and 5
Boštjan Brešar, Přemysl Holub, Marko Jakovac +1
A proper coloring of vertices of a graph is called -frugal if no color appears more than times in the neighborhood of any vertex of . While -frugal coloring coinci…
-packing colorings of distance graphs with distance sets of cardinality
Boštjan Brešar, Jasmina Ferme, Přemysl Holub +2
For a non-decreasing sequence of positive integers, a partition of the vertex set of a graph into subsets , such that vertices in …
Forbidden induced subgraphs for perfectness of claw-free graphs of independence number at least 4
Christoph Brause, Trung Duy Doan, Přemysl Holub +4
For every graph , we consider the class of all connected -free graphs which are distinct from an odd cycle and have independence number at least , and we show…
Star Edge-Coloring of Square Grids
Přemysl Holub, Borut Lužar, Erika Mihaliková +2
A star edge-coloring of a graph is a proper edge-coloring without bichromatic paths or cycles of length four. The smallest integer such that admits a star edge-coloring…
-packing chromatic vertex-critical graphs
Přemysl Holub, Marko Jakovac, Sandi Klavžar
For a non-decreasing sequence of positive integers , the {\em -packing chromatic number} of is the smallest integer such that the vertex s…
On forbidden induced subgraphs for K_{1,3}-free perfect graphs
Christoph Brause, Přemysl Holub, Adam Kabela +3
Considering connected -free graphs with independence number at least , Chudnovsky and Seymour (2010) showed that every such graph, say , is -colourable where …