The following pages link to Oleg V. Borodin (Q505455):
Displaying 50 items.
- (Q226459) (redirect page) (← links)
- Weight of edges in normal plane maps (Q271617) (← links)
- An analogue of Franklin's theorem (Q294562) (← links)
- The weight of faces in normal plane maps (Q294568) (← links)
- Light and low 5-stars in normal plane maps with minimum degree 5 (Q311243) (← links)
- An extension of Kotzig's theorem (Q339478) (← links)
- Describing \((d-2)\)-stars at \(d\)-vertices, \(d\leq 5\), in normal plane maps (Q383686) (← links)
- Describing 4-stars at 5-vertices in normal plane maps with minimum degree 5 (Q383687) (← links)
- Every 3-polytope with minimum degree 5 has a 6-cycle with maximum degree at most 11 (Q393180) (← links)
- On 1-improper 2-coloring of sparse graphs (Q393935) (← links)
- Describing 3-paths in normal plane maps (Q394206) (← links)
- Describing 3-faces in normal plane maps with minimum degree 4 (Q394234) (← links)
- Describing faces in plane triangulations (Q394346) (← links)
- Light \(C_4\) and \(C_5\) in 3-polytopes with minimum degree 5 (Q396738) (← links)
- \((k,1)\)-coloring of sparse graphs (Q409448) (← links)
- \((k,j)\)-coloring of sparse graphs (Q411834) (← links)
- Combinatorial structure of faces in triangulated 3-polytopes with minimum degree 4 (Q467650) (← links)
- All tight descriptions of 3-stars in 3-polytopes with girth 5 (Q505457) (← links)
- Describing 4-paths in 3-polytopes with minimum degree 5 (Q511329) (← links)
- Low minor 5-stars in 3-polytopes with minimum degree 5 and no 6-vertices (Q526251) (← links)
- Injective \((\Delta + 1)\)-coloring of planar graphs with girth 6 (Q536624) (← links)
- List injective colorings of planar graphs (Q615993) (← links)
- List 2-facial 5-colorability of plane graphs with girth at least 12 (Q658054) (← links)
- Vertex decompositions of sparse graphs into an independent vertex set and a subgraph of maximum degree at most 1 (Q665888) (← links)
- Acyclic 3-choosability of sparse graphs with girth at least 7 (Q708400) (← links)
- Planar graphs without triangles adjacent to cycles of length from 4 to 7 are 3-colorable (Q709301) (← links)
- Acyclic 4-choosability of planar graphs with neither 4-cycles nor triangular 6-cycles (Q710596) (← links)
- Acyclic 4-choosability of planar graphs without adjacent short cycles (Q713156) (← links)
- On the weight of minor faces in triangle-free 3-polytopes (Q726639) (← links)
- Every triangulated 3-polytope of minimum degree 4 has a 4-path of weight at most 27 (Q727044) (← links)
- Planar 4-critical graphs with four triangles (Q740268) (← links)
- Each 3-polytope with minimum degree 5 has a 7-cycle with maximum degree at most 15 (Q748469) (← links)
- Solution of problems of Kotzig and Grünbaum concerning the isolation of cycles in planar graphs (Q753827) (← links)
- Weight of 3-paths in sparse plane graphs (Q888584) (← links)
- Acyclic 3-choosability of planar graphs with no cycles of length from 4 to 11 (Q890814) (← links)
- In memory of Dmitriĭ Germanovich Fon-Der-Flaass (Q890843) (← links)
- The weight of edge in 3-polytopes (Q892017) (← links)
- Low stars in normal plane maps with minimum degree 4 and no adjacent 4-vertices (Q898158) (← links)
- The vertex-face weight of edges in 3-polytopes (Q901903) (← links)
- Decomposing a planar graph with girth 9 into a forest and a matching (Q925026) (← links)
- Minimax degrees of quasiplanar graphs with no short cycles other than triangles (Q947039) (← links)
- Planar graphs decomposable into a forest and a matching (Q998522) (← links)
- List 2-distance \((\varDelta +2)\)-coloring of planar graphs with girth six (Q1024323) (← links)
- Planar graphs without 5- and 7-cycles and without adjacent triangles are 3-colorable (Q1026007) (← links)
- Planar graphs without adjacent cycles of length at most seven are 3-colorable (Q1045158) (← links)
- 2-distance \((\varDelta +2)\)-coloring of planar graphs with girth six and \(\varDelta \geq 18\) (Q1045187) (← links)
- Irreducible graphs in the Grünbaum-Havel 3-colour problem (Q1126208) (← links)
- Generalization of a theorem of Kotzig and a prescribed coloring of the edges of planar graphs (Q1173768) (← links)
- Diagonal coloring of the vertices of triangulations (Q1193436) (← links)
- Decomposition of \(K_{13}\) into a torus graph and a graph imbedded in the Klein bottle (Q1193437) (← links)
