The following pages link to Janez Žerovnik (Q186164):
Displaying 50 items.
- Factoring cartesian‐product graphs (Q4309984) (← links)
- (Q4328255) (← links)
- (Q4348950) (← links)
- (Q4394828) (← links)
- (Q4431015) (← links)
- (Q4511029) (← links)
- (Q4519268) (← links)
- (Q4519306) (← links)
- On the linear<i>K</i>-arboricity of cubic graphs (Q4521950) (← links)
- Recognizing weighted directed cartesian graph bundles (Q4522459) (← links)
- (Q4531975) (← links)
- (Q4546602) (← links)
- (Q4547479) (← links)
- (Q4547480) (← links)
- (Q4568163) (← links)
- Reliability Hosoya-Wiener Polynomial of Double Weighted Trees* (Q4589216) (← links)
- (Q4604353) (← links)
- The Hosoya polynomial of double weighted graphs (Q4629558) (← links)
- (Q4674155) (← links)
- (Q4674156) (← links)
- (Q4674183) (← links)
- 2-local <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si1.gif" overflow="scroll"><mml:mn>4</mml:mn><mml:mo stretchy="false">/</mml:mo><mml:mn>3</mml:mn></mml:math>-competitive algorithm for multicoloring hexagonal graphs (Q4675487) (← links)
- (Q4695019) (← links)
- (Q4815802) (← links)
- (Q4815835) (← links)
- Weak k-reconstruction of Cartesian products (Q4823308) (← links)
- (Q4934361) (← links)
- (Q4944167) (← links)
- (Q4975260) (← links)
- (Q4975296) (← links)
- On median and quartile sets of ordered random variables (Q5121562) (← links)
- (Q5206328) (← links)
- Networks with Extremal Closeness (Q5229300) (← links)
- (Q5296363) (← links)
- (Q5310614) (← links)
- Algorithmic Learning Theory (Q5395052) (← links)
- (Q5420870) (← links)
- Edge Fault-Diameter of Cartesian Product of Graphs (Q5425973) (← links)
- A note on<i>n</i>-tuple colourings and circular colourings of planar graphs with large odd girth (Q5431618) (← links)
- (Q5439008) (← links)
- (Q5446945) (← links)
- (Q5446946) (← links)
- (Q5446947) (← links)
- (Q5471149) (← links)
- (Q5482462) (← links)
- (Q5482469) (← links)
- (Q5482507) (← links)
- (Q5688116) (← links)
- (Q5708552) (← links)
- (Q5708617) (← links)
