The following pages link to Vladimir P. Korzhik (Q394201):
Displaying 46 items.
- Proper 1-immersions of graphs triangulating the plane (Q394202) (← links)
- On the 1-chromatic number of nonorientable surfaces with large genus (Q412163) (← links)
- Exponential families of nonisomorphic nonorientable genus embeddings of complete graphs (Q598471) (← links)
- Coloring vertices and faces of maps on surfaces (Q708418) (← links)
- Exponentially many nonisomorphic genus embeddings of \(K_{n,m}\) (Q710593) (← links)
- Auxiliary embeddings and constructing triangular embeddings of joins of complete graphs with edgeless graphs (Q898131) (← links)
- Nonorientable triangular embeddings of complete graphs with arbitrarily large looseness (Q932590) (← links)
- Exponentially many nonisomorphic orientable triangular embeddings of \(K_{12s+3}\) (Q1011722) (← links)
- (Q1043638) (redirect page) (← links)
- Orientable biembeddings of cyclic Steiner triple systems from current assignments on Möbius ladder graphs (Q1043639) (← links)
- (Q1313859) (redirect page) (← links)
- Realizing the chromatic numbers of triangulations of surfaces (Q1313860) (← links)
- A lower bound for the one-chromatic number of a surface (Q1328382) (← links)
- A tighter bounding interval for the 1-chromatic number of a surface (Q1357725) (← links)
- An infinite series of surfaces with known 1-chromatic number (Q1366608) (← links)
- A possibly infinite series of surfaces with known 1-chromatic number (Q1367034) (← links)
- On the minimal nonzero distance between triangular embeddings of a complete graph. (Q1402074) (← links)
- Another proof of the map color theorem for nonorientable surfaces. (Q1403919) (← links)
- Nonadditivity of the 1-genus of a graph (Q1584230) (← links)
- Triangular embeddings of \(K_n-K_m\) with unboundedly large \(m\) (Q1584375) (← links)
- On the number of nonisomorphic orientable regular embeddings of complete graphs (Q1850510) (← links)
- Exponential families of non-isomorphic non-triangular orientable genus embeddings of complete graphs. (Q1850631) (← links)
- Nonorientable biembeddings of Steiner triple systems (Q1877654) (← links)
- A nonorientable triangular embedding of \(K_ n-K_ 2\), \(n\equiv 8\pmod{12}\) (Q1894771) (← links)
- Planar graphs having no proper 2-immersions in the plane. II (Q2037554) (← links)
- Planar graphs having no proper 2-immersions in the plane. I (Q2037555) (← links)
- Planar graphs having no proper 2-immersions in the plane. III (Q2037593) (← links)
- Nonorientable biembeddings of cyclic Steiner triple systems generated by Skolem sequences (Q2342621) (← links)
- Small surface trades in triangular embeddings (Q2433720) (← links)
- Exponentially many nonisomorphic orientable triangular embeddings of \(K_{12s}\) (Q2469982) (← links)
- A new approach to constructing exponentially many nonisomorphic nonorientable triangular embeddings of complete graphs (Q2469983) (← links)
- Minimal non-1-planar graphs (Q2470008) (← links)
- On the maximal distance between triangular embeddings of a complete graph. (Q2490841) (← links)
- Recursive constructions and nonisomorphic minimal nonorientable embeddings of complete graphs (Q2515556) (← links)
- A simple proof of the map color theorem for nonorientable surfaces (Q2673477) (← links)
- Generating Nonisomorphic Quadrangular Embeddings of a Complete Graph (Q2853333) (← links)
- (Q3484862) (← links)
- Minimal Obstructions for 1-Immersions and Hardness of 1-Planarity Testing (Q3611864) (← links)
- Complete triangulations of a given order generated from a multitude of nonisomorphic cubic graphs by current assignments (Q3652537) (← links)
- (Q4318221) (← links)
- (Q4713918) (← links)
- (Q4887821) (← links)
- A simple construction of exponentially many nonisomorphic orientable triangular embeddings of K_12s (Q5151496) (← links)
- Finite fields and the 1‐chromatic number of orientable surfaces (Q5190327) (← links)
- (Q5463542) (← links)
- All 2-planar graphs having the same spanning subgraph (Q6087085) (← links)
