The following pages link to Stanlislav Jendroľ (Q582576):
Displaying 50 items.
- (Q219354) (redirect page) (← links)
- 3-paths in graphs with bounded average degree (Q274685) (← links)
- On the maximum weight of a dense connected graph of given order and size (Q279225) (← links)
- On the maximum weight of a sparse connected graph of given order and size (Q293629) (← links)
- Facial packing edge-coloring of plane graphs (Q313797) (← links)
- A survey of irregularity strength (Q324899) (← links)
- Rainbow numbers for matchings in plane triangulations (Q397167) (← links)
- A Dirac theorem for trestles (Q427855) (← links)
- Facial parity edge colouring of plane pseudographs (Q442406) (← links)
- A note on vertex colorings of plane graphs (Q472144) (← links)
- Describing short paths in plane graphs of girth at least 5 (Q472958) (← links)
- Facial edge ranking of plane graphs (Q494424) (← links)
- WORM colorings of planar graphs (Q521753) (← links)
- On quadrangular convex 3-polytopes with at most two types of edges (Q582578) (← links)
- Four-dimensional polytopes: Alicia Boole Stott's algorithm (Q608925) (← links)
- Total labellings, irregularity strengths and colourings (Q624133) (← links)
- (Q626870) (redirect page) (← links)
- Parity vertex colouring of plane graphs (Q626871) (← links)
- Nonrepetitive vertex colorings of graphs (Q658062) (← links)
- Looseness of plane graphs (Q659673) (← links)
- On face vectors and vertex vectors of convex polyhedra (Q685585) (← links)
- Hamiltonian tournaments and Gorenstein rings (Q697082) (← links)
- Two local and one global properties of 3-connected graphs on compact 2-dimensional manifolds (Q707019) (← links)
- On the simplicial 3-polytopes with only two types of edges (Q791872) (← links)
- On a problem of J. Zaks concerning 5-valent 3-connected planar graphs (Q793048) (← links)
- Entire chromatic number and \(\Delta\)-matching of outerplane graphs (Q815128) (← links)
- Graph polynomials and paintability of plane graphs (Q833000) (← links)
- The non-Platonic and non-Archimedean noncomposite polyhedra (Q844552) (← links)
- Rainbowness of cubic plane graphs (Q856887) (← links)
- The circular chromatic index of graphs of high girth (Q858677) (← links)
- On irregular total labellings (Q878629) (← links)
- Independence number and vertex-disjoint cycles (Q878646) (← links)
- Facial entire colouring of plane graphs (Q898120) (← links)
- Optimal unavoidable sets of types of 3-paths for planar graphs of given girth (Q898139) (← links)
- Maximum edge-colorings of graphs (Q907836) (← links)
- Convex 3-polytopes with exactly two types of edges (Q917924) (← links)
- On the crossing numbers of \(K_m\square C_n\) and \(K_{m,l}\square P_n\) (Q944744) (← links)
- Total edge irregularity strength of complete graphs and complete bipartite graphs (Q960943) (← links)
- A result on combinatorial curvature for embedded graphs on a surface (Q998402) (← links)
- Convex polyhedra with parquet faces (Q1048551) (← links)
- (Q1109048) (redirect page) (← links)
- On a class of Hamiltonian polytopes (Q1109049) (← links)
- A non-involutory selfduality (Q1116093) (← links)
- Hamiltonicity in 3-domination-critical graphs with \(\alpha= \delta+2\) (Q1283070) (← links)
- Forbidden subgraphs, stability and hamiltonicity (Q1292819) (← links)
- On light cycles in plane triangulations (Q1292852) (← links)
- Light paths with an odd number of vertices in large polyhedral maps (Q1293420) (← links)
- Some remarks on Jaeger's dual-hamiltonian conjecture (Q1296151) (← links)
- Triangles with restricted degrees of their boundary vertices in plane triangulations (Q1297408) (← links)
- Homogeneous embeddings of cycles in graphs (Q1299993) (← links)
