The following pages link to Marko Jakovac (Q329712):
Displaying 24 items.
- The security number of strong grid-like graphs (Q329713) (← links)
- The partition dimension of strong product graphs and Cartesian product graphs (Q397144) (← links)
- The b-chromatic number of cubic graphs (Q604658) (← links)
- The \(b\)-chromatic index of a graph (Q745926) (← links)
- Vertex-, edge-, and total-colorings of Sierpiński-like graphs (Q1024467) (← links)
- The \(b\)-chromatic number and related topics -- a survey (Q1682893) (← links)
- Relating the annihilation number and the 2-domination number of block graphs (Q1741511) (← links)
- On the \(k\)-path vertex cover of some graph products (Q1759813) (← links)
- On game chromatic vertex-critical graphs (Q2107136) (← links)
- On graphs with equal total domination and Grundy total domination numbers (Q2118158) (← links)
- \(S\)-packing chromatic vertex-critical graphs (Q2197411) (← links)
- Indicated coloring game on Cartesian products of graphs (Q2217485) (← links)
- On the security number of the Cartesian product of graphs (Q2231753) (← links)
- On the \(b\)-chromatic number of regular graphs (Q2275938) (← links)
- The \(k\)-path vertex cover of rooted product graphs (Q2348061) (← links)
- On the vertex \(k\)-path cover (Q2446837) (← links)
- On the b-chromatic number of some graph products (Q2915433) (← links)
- (Q3447617) (← links)
- On global (strong) defensive alliances in some product graphs (Q4598302) (← links)
- Relating the total domination number and the annihilation number of cactus graphs and block graphs (Q5225033) (← links)
- The security number of lexicographic products (Q5375880) (← links)
- The <i>k</i>‐path vertex cover: General bounds and chordal graphs (Q6087563) (← links)
- $S$-packing colorings of distance graphs with distance sets of cardinality $2$ (Q6730562) (← links)
- Burning game (Q6744911) (← links)
