The following pages link to Janez Žerovnik (Q186164):
Displaying 50 items.
- (Q351551) (redirect page) (← links)
- GIS technology as an environment for testing an advanced mathematical model for optimization of road maintenance (Q351554) (← links)
- A linear time algorithm for \(7\)-\([3]\)coloring triangle-free hexagonal graphs (Q436606) (← links)
- Roman domination number of the Cartesian products of paths and cycles (Q456341) (← links)
- Improved upper bounds for vertex and edge fault diameters of Cartesian graph bundles (Q479023) (← links)
- On rainbow domination numbers of graphs (Q497921) (← links)
- Broadcasting on cactus graphs (Q512890) (← links)
- Simpler multicoloring of triangle-free hexagonal graphs (Q658035) (← links)
- Edge, vertex and mixed fault diameters (Q840704) (← links)
- Fault-diameter of Cartesian graph bundles (Q845824) (← links)
- On domination numbers of graphs bundles (Q854408) (← links)
- Weak reconstruction of strong product graphs (Q864154) (← links)
- An almost complete description of perfect codes in direct products of cycles (Q864867) (← links)
- Perfect codes in direct products of cycles-a complete characterization (Q931836) (← links)
- Wide diameter of Cartesian graph bundles (Q973142) (← links)
- The edge fault-diameter of Cartesian graph bundles (Q1024302) (← links)
- Hamilton cycles in graph bundles over a cycle with tree as a fibre (Q1044911) (← links)
- A parallel variant of a heuristical algorithm for graph coloring -- corrigendum (Q1200998) (← links)
- A parallel variant of a heuristical algorithm for graph colouring (Q1262783) (← links)
- A randomised heuristical algorithm for estimating the chromatic number of a graph (Q1262784) (← links)
- A randomized algorithm for \(k\)-colorability (Q1331989) (← links)
- Finding a five bicolouring of a triangle-free subgraph of the triangular lattice (Q1349081) (← links)
- Unique square property and fundamental factorizations of graph bundles (Q1349120) (← links)
- Recognizing Cartesian graph bundles (Q1356477) (← links)
- Distance-related invariants on polygraphs (Q1377616) (← links)
- The independence number of the strong product of odd cycles (Q1379990) (← links)
- The obnoxious center problem on weighted cactus graphs. (Q1427192) (← links)
- Counterexamples to the uniform shortest path routing conjecture for vertex-transitive graphs (Q1613354) (← links)
- Algorithm for recognizing Cartesian graph bundles (Q1613382) (← links)
- Behzad-Vizing conjecture and Cartesian-product graphs (Q1614125) (← links)
- On 2-rainbow domination of generalized Petersen graphs (Q1730265) (← links)
- Bounding the probability of success of stochastic methods for global optimization (Q1802488) (← links)
- Homomorphisms of hexagonal graphs to odd cycles (Q1827797) (← links)
- A polynomial algorithm for the strong Helly property (Q1847378) (← links)
- Improved lower bound on the Shannon capacity of \(C_7\) (Q1847390) (← links)
- On the weak reconstruction of Cartesian-product graphs (Q1916107) (← links)
- Algebraic approach to fasciagraphs and rotagraphs (Q1917348) (← links)
- 1-local 7/5-competitive algorithm for multicoloring hexagonal graphs (Q1945170) (← links)
- Methodologies and applications for resilient global development from the aspect of SDI-SOR special issues of CJOR (Q2051177) (← links)
- On sufficient properties of sufficient matrices (Q2051181) (← links)
- A linear time algorithm for weighted \(k\)-fair domination problem in cactus graphs (Q2079283) (← links)
- Clustering as a dual problem to colouring (Q2140780) (← links)
- Real forms of the complex Neumann system: a method for finding real roots of polynomial \(U_{\mathcal{S}} ( \lambda )\) (Q2226307) (← links)
- Constructive heuristics for the canister filling problem (Q2276059) (← links)
- Perfect codes in direct graph bundles (Q2346568) (← links)
- A counterexample to conjecture of Barefoot, Harary, and Jones (Q2366962) (← links)
- 2-local 5/4-competitive algorithm for multicoloring triangle-free hexagonal graphs (Q2390258) (← links)
- Independent rainbow domination of graphs (Q2421364) (← links)
- Mixed fault diameter of Cartesian graph bundles (Q2446299) (← links)
- Partial cubes are distance graphs (Q2470449) (← links)
