The following pages link to Matjaž Krnc (Q608286):
Displaying 19 items.
- Improved induced matchings in sparse graphs (Q608287) (← links)
- Cyclic colorings of plane graphs with independent faces (Q661937) (← links)
- Cyclic 7-edge-cuts in fullerene graphs (Q848197) (← links)
- Edge elimination and weighted graph classes (Q2110614) (← links)
- Recognizing graph search trees (Q2132337) (← links)
- Recognizing generalized Petersen graphs in linear time (Q2192132) (← links)
- Eccentricity of networks with structural constraints (Q2194537) (← links)
- Group centralization of network indices (Q2345606) (← links)
- Centralization of transmission in networks (Q2515584) (← links)
- Distinguishing graphs via cycles (Q2695304) (← links)
- Fair allocation of indivisible items with conflict graphs (Q2701390) (← links)
- (Q2856711) (← links)
- Extending Fractional Precolorings (Q2910941) (← links)
- Fair allocation algorithms for indivisible items under structured conflict constraints (Q6056608) (← links)
- Shifting paths to avoidable ones (Q6057583) (← links)
- Toward characterizing locally common graphs (Q6077054) (← links)
- Some results on LCTR, an impartial game on partitions (Q6174698) (← links)
- Sprague-Grundy values and complexity for LCTR (Q6193951) (← links)
- Closeness Centralization Measure for Two-mode Data of Prescribed Sizes (Q6276501) (← links)