The following pages link to Borut Lužar (Q313801):
Displaying 50 items.
- On incidence coloring conjecture in Cartesian products of graphs (Q313802) (← links)
- Improved bound on facial parity edge coloring (Q390304) (← links)
- Acyclic edge coloring of planar graphs with \(\varDelta\) colors (Q423967) (← links)
- Some remarks on inverse Wiener index problem (Q444451) (← links)
- Note on coloring of double disk graphs (Q475816) (← links)
- Sandwiching the (generalized) Randić index (Q479035) (← links)
- \(\ell\)-facial edge colorings of graphs (Q479043) (← links)
- Adynamic coloring of graphs (Q777385) (← links)
- Cyclic 7-edge-cuts in fullerene graphs (Q848197) (← links)
- Injective colorings of planar graphs with few colors (Q1045050) (← links)
- New bounds for locally irregular chromatic index of bipartite and subcubic graphs (Q1631691) (← links)
- On a star chromatic index of subcubic graphs (Q1690022) (← links)
- On facial unique-maximum (edge-)coloring (Q1701086) (← links)
- On vertex-parity edge-colorings (Q1702821) (← links)
- On the difference between the Szeged and the Wiener index (Q1740024) (← links)
- On repetition thresholds of caterpillars and trees of bounded degree (Q1753030) (← links)
- Proper conflict-free and unique-maximum colorings of planar graphs with respect to neighborhoods (Q2097169) (← links)
- Further extensions of the Grötzsch theorem (Q2124638) (← links)
- Oriented chromatic number of Cartesian products \(P_m \square P_n\) and \(C_m \square P_n \) (Q2151213) (← links)
- The Dudeney-Stockmeyer conjecture (Q2161227) (← links)
- On non-repetitive sequences of arithmetic progressions: the cases \(k\in\{4,5,6,7,8\}\) (Q2181220) (← links)
- Note on 3-choosability of planar graphs with maximum degree 4 (Q2324500) (← links)
- On a generalization of Thue sequences (Q2346472) (← links)
- Note on incidence chromatic number of subquartic graphs (Q2410036) (← links)
- Star edge-coloring of square grids (Q2662575) (← links)
- 3-facial edge-coloring of plane graphs (Q2689486) (← links)
- On the diameter and some related invariants of fullerene graphs (Q2856711) (← links)
- A planar linear arboricity conjecture (Q2891050) (← links)
- Extending fractional precolorings (Q2910941) (← links)
- Counterexamples to a conjecture on injective colorings (Q2950074) (← links)
- (Q2975329) (← links)
- Odd edge coloring of graphs (Q3465663) (← links)
- Star Edge Coloring of Some Classes of Graphs (Q3466355) (← links)
- (Q3575471) (← links)
- Note on list star edge‐coloring of subcubic graphs (Q4629998) (← links)
- Between Proper and Strong Edge-Colorings of Subcubic Graphs (Q5041205) (← links)
- BiqBin: Moving Boundaries for NP-hard Problems by HPC (Q5119114) (← links)
- From NMNR-coloring of hypergraphs to homogenous coloring of graphs (Q5357311) (← links)
- BiqBin: A Parallel Branch-and-bound Solver for Binary Quadratic Problems with Linear Constraints (Q5883708) (← links)
- Strong edge-coloring of planar graphs (Q5920291) (← links)
- Between proper and strong edge‐colorings of subcubic graphs (Q6046648) (← links)
- Locally irregular edge-coloring of subcubic graphs (Q6064843) (← links)
- Strong edge colorings of graphs and the covers of Kneser graphs (Q6081882) (← links)
- Revisiting semistrong edge‐coloring of graphs (Q6199384) (← links)
- Star Edge-Coloring of Square Grids (Q6340166) (← links)
- 3-facial edge-coloring of plane graphs (Q6368975) (← links)
- Note on robust coloring of planar graphs (Q6517575) (← links)
- Packing coloring of hypercubes with extended Hamming codes (Q6633542) (← links)
- Note on robust coloring of planar graphs (Q6667293) (← links)
- Is science driven by principal investigators? (Q6702071) (← links)
