| Publication | Date of Publication | Type |
|---|
Describing edges in normal plane maps having no adjacent 3-faces
Sibirskie Elektronnye Matematicheskie Izvestiya | 2024-11-26 | Paper |
Light 3-faces in 3-polytopes without adjacent triangles
Discrete Mathematics | 2024-11-09 | Paper |
Light 3-paths in 3-polytopes without adjacent triangles
Siberian Mathematical Journal | 2024-03-27 | Paper |
Tight description of faces of triangulations on the torus
Discrete Mathematics | 2023-06-12 | Paper |
Combinatorial structure of faces in triangulations on surfaces
Siberian Mathematical Journal | 2022-08-03 | Paper |
Another tight description of faces in plane triangulations with minimum degree 4
Discrete Mathematics | 2022-06-14 | Paper |
3-vertices with fewest 2-neighbors in plane graphs with no long paths of 2-vertices
Discrete Mathematics | 2022-05-27 | Paper |
Describing minor 5-stars in 3-polytopes with minimum degree 5 and no vertices of degree 6 or 7
Discussiones Mathematicae Graph Theory | 2022-03-22 | Paper |
Tight description of faces in torus triangulations with minimum degree 5
Sibirskie Elektronnye Matematicheskie Izvestiya | 2021-12-08 | Paper |
Almost all about light neighborhoods of 5-vertices in 3-polytopes with minimum degree 5
Discrete Mathematics | 2021-11-23 | Paper |
All tight descriptions of major 3-paths in 3-polytopes without 3-vertices
Sibirskie Elektronnye Matematicheskie Izvestiya | 2021-06-17 | Paper |
A tight description of 3-polytopes by their major 3-paths
Siberian Mathematical Journal | 2021-06-07 | Paper |
Heights of minor faces in 3-polytopes
Siberian Mathematical Journal | 2021-04-08 | Paper |
All tight descriptions of 3-paths in plane graphs with girth at least 7
Discrete Mathematics | 2021-03-25 | Paper |
Soft 3-stars in sparse plane graphs
Sibirskie Elektronnye Matematicheskie Izvestiya | 2020-11-24 | Paper |
An extension of Franklin's theorem
Sibirskie Elektronnye Matematicheskie Izvestiya | 2020-09-24 | Paper |
Light minor 5-stars in 3-polytopes with minimum degree 5 and no 6-vertices
Discussiones Mathematicae Graph Theory | 2020-08-26 | Paper |
Low 5-stars at 5-vertices in 3-polytopes with minimum degree 5 and no vertices of degree from 7 to 9
Discussiones Mathematicae Graph Theory | 2020-08-26 | Paper |
All tight descriptions of 3-paths in plane graphs with girth 8
Sibirskie Elektronnye Matematicheskie Izvestiya | 2020-05-21 | Paper |
All tight descriptions of 3-paths centered at 2-vertices in plane graphs with girth at least 6
Sibirskie Elektronnye Matematicheskie Izvestiya | 2019-11-07 | Paper |
Low faces of restricted degree in 3-polytopes
Siberian Mathematical Journal | 2019-11-01 | Paper |
Describing faces in 3-polytopes with no vertices of degree from 5 to 7
Discrete Mathematics | 2019-09-11 | Paper |
Describing the neighborhoods of 5-vertices in 3-polytopes with minimum degree 5 and no vertices of degree from 6 to 8
Discrete Mathematics | 2019-08-20 | Paper |
Light minor 5-stars in 3-polytopes with minimum degree 5
Siberian Mathematical Journal | 2019-07-18 | Paper |
An improvement of Lebesgue's description of edges in 3-polytopes and faces in plane quadrangulations
Discrete Mathematics | 2019-06-27 | Paper |
Light 3-stars in sparse plane graphs
Sibirskie Elektronnye Matematicheskie Izvestiya | 2019-05-08 | Paper |
All tight descriptions of 3-paths in plane graphs with girth at least 9
Sibirskie Elektronnye Matematicheskie Izvestiya | 2018-10-31 | Paper |
Low minor faces in 3-polytopes
Discrete Mathematics | 2018-10-23 | Paper |
All one-term tight descriptions of 3-paths in normal plane maps without \(K_4 - e\)
Discrete Mathematics | 2018-10-23 | Paper |
Describing neighborhoods of 5-vertices in 3-polytopes with minimum degree 5 and without vertices of degrees from 7 to 11
Discussiones Mathematicae Graph Theory | 2018-06-29 | Paper |
Describing neighborhoods of 5-vertices in a class of 3-polytopes with minimum degree 5
Siberian Mathematical Journal | 2018-06-20 | Paper |
More about the height of faces in 3-polytopes
Discussiones Mathematicae Graph Theory | 2018-03-23 | Paper |
Heights of minor 5-stars in 3-polytopes with minimum degree 5 and no vertices of degree 6 and 7
Discrete Mathematics | 2018-01-19 | Paper |
Low and light 5-stars in 3-polytopes with minimum degree 5 and restrictions on the degrees of major vertices
Siberian Mathematical Journal | 2017-10-27 | Paper |
Refined weight of edges in normal plane maps
Discrete Mathematics | 2017-09-05 | Paper |
Tight descriptions of 3-paths in normal plane maps
Journal of Graph Theory | 2017-06-30 | Paper |
The height of faces of 3-polytopes
Siberian Mathematical Journal | 2017-06-30 | Paper |
All tight descriptions of 4-paths in 3-polytopes with minimum degree 5
Graphs and Combinatorics | 2017-06-29 | Paper |
A Steinberg-like approach to describing faces in 3-polytopes
Graphs and Combinatorics | 2017-06-29 | Paper |
On light neighborhoods of 5-vertices in 3-polytopes with minimum degree 5
Discrete Mathematics | 2017-06-23 | Paper |
Low minor 5-stars in 3-polytopes with minimum degree 5 and no 6-vertices
Discrete Mathematics | 2017-05-10 | Paper |
Describing 4-paths in 3-polytopes with minimum degree 5
Siberian Mathematical Journal | 2017-02-15 | Paper |
All tight descriptions of 3-stars in 3-polytopes with girth 5
Discussiones Mathematicae Graph Theory | 2017-01-23 | Paper |
Low 5-stars in normal plane maps with minimum degree 5
Discrete Mathematics | 2016-12-14 | Paper |
Every triangulated 3-polytope of minimum degree 4 has a 4-path of weight at most 27
The Electronic Journal of Combinatorics | 2016-12-06 | Paper |
Quantification of sampling uncertainty for molecular dynamics simulation: time-dependent diffusion coefficient in simple fluids
Journal of Computational Physics | 2016-12-05 | Paper |
An extension of Kotzig's theorem
Discussiones Mathematicae Graph Theory | 2016-11-11 | Paper |
Light and low 5-stars in normal plane maps with minimum degree 5
Siberian Mathematical Journal | 2016-09-29 | Paper |
Light neighborhoods of 5-vertices in 3-polytopes with minimum degree 5
Sibirskie Elektronnye Matematicheskie Izvestiya | 2016-07-28 | Paper |
On the weight of minor faces in triangle-free 3-polytopes
Discussiones Mathematicae Graph Theory | 2016-07-13 | Paper |
An analogue of Franklin's theorem
Discrete Mathematics | 2016-06-16 | Paper |
The weight of faces in normal plane maps
Discrete Mathematics | 2016-06-16 | Paper |
Weight of edges in normal plane maps
Discrete Mathematics | 2016-04-07 | Paper |
Heights of minor faces in triangle-free 3-polytopes
Siberian Mathematical Journal | 2016-02-19 | Paper |
The vertex-face weight of edges in 3-polytopes
Siberian Mathematical Journal | 2016-01-06 | Paper |
Low stars in normal plane maps with minimum degree 4 and no adjacent 4-vertices
Discrete Mathematics | 2015-12-08 | Paper |
The weight of edge in 3-polytopes
Sibirskie Elektronnye Matematicheskie Izvestiya | 2015-11-18 | Paper |
Acyclic 3-choosability of planar graphs with no cycles of length from 4 to 11
Sibirskie Elektronnye Matematicheskie Izvestiya | 2015-11-16 | Paper |
In memory of Dmitriĭ Germanovich Fon-Der-Flaass
Sibirskie Elektronnye Matematicheskie Izvestiya | 2015-11-16 | Paper |
Weight of 3-paths in sparse plane graphs
The Electronic Journal of Combinatorics | 2015-11-02 | Paper |
Each 3-polytope with minimum degree 5 has a 7-cycle with maximum degree at most 15
Siberian Mathematical Journal | 2015-10-29 | Paper |
Low edges in 3-polytopes
Discrete Mathematics | 2015-08-05 | Paper |
Describing tight descriptions of 3-paths in triangle-free normal plane maps
Discrete Mathematics | 2015-06-29 | Paper |
Combinatorial structure of faces in triangulated 3-polytopes with minimum degree 4
Siberian Mathematical Journal | 2014-11-04 | Paper |
Planar 4-critical graphs with four triangles
European Journal of Combinatorics | 2014-09-02 | Paper |
Light \(C_4\) and \(C_5\) in 3-polytopes with minimum degree 5
Discrete Mathematics | 2014-08-14 | Paper |
Precise upper bound for the strong edge chromatic number of sparse planar graphs
Discussiones Mathematicae Graph Theory | 2014-07-30 | Paper |
5-stars of low weight in normal plane maps with minimum degree 5
Discussiones Mathematicae Graph Theory | 2014-07-28 | Paper |
Partitioning sparse plane graphs into two induced subgraphs of small degree
Sibirskie Elektronnye Matematicheskie Izvestiya | 2014-06-13 | Paper |
Circular \((5,2)\)-coloring of sparse graphs
Sibirskie Elektronnye Matematicheskie Izvestiya | 2014-06-13 | Paper |
Planar graphs without triangular 4-cycles are 3-choosable
Sibirskie Elektronnye Matematicheskie Izvestiya | 2014-06-13 | Paper |
List 2-arboricity of planar graphs with no triangles at distance less than two
Sibirskie Elektronnye Matematicheskie Izvestiya | 2014-06-13 | Paper |
Short proofs of coloring theorems on planar graphs
European Journal of Combinatorics | 2014-03-25 | Paper |
Defective 2-colorings of sparse graphs
Journal of Combinatorial Theory. Series B | 2014-02-06 | Paper |
Describing faces in plane triangulations
Discrete Mathematics | 2014-01-27 | Paper |
Describing 3-paths in normal plane maps
Discrete Mathematics | 2014-01-24 | Paper |
On 1-improper 2-coloring of sparse graphs
Discrete Mathematics | 2014-01-24 | Paper |
Describing 3-faces in normal plane maps with minimum degree 4
Discrete Mathematics | 2014-01-24 | Paper |
Every 3-polytope with minimum degree 5 has a 6-cycle with maximum degree at most 11
Discrete Mathematics | 2014-01-16 | Paper |
Describing \((d-2)\)-stars at \(d\)-vertices, \(d\leq 5\), in normal plane maps
Discrete Mathematics | 2013-12-05 | Paper |
Describing 4-stars at 5-vertices in normal plane maps with minimum degree 5
Discrete Mathematics | 2013-12-05 | Paper |
Acyclic 4-choosability of planar graphs with no 4- and 5-cycles
Journal of Graph Theory | 2013-04-19 | Paper |
Colorings of plane graphs: a survey
Discrete Mathematics | 2013-03-01 | Paper |
In memoriam Ivan Grigor'evich Dmitriev
| 2013-02-11 | Paper |
scientific article; zbMATH DE number 6125173 (Why is no real title available?)
| 2013-01-14 | Paper |
A step towards the strong version of Havel's three color conjecture
Journal of Combinatorial Theory. Series B | 2013-01-14 | Paper |
Acyclic 4-choosability of planar graphs without adjacent short cycles
Discrete Mathematics | 2012-10-26 | Paper |
2-distance 4-colorability of planar subcubic graphs with girth at least 22
Discussiones Mathematicae. Graph Theory | 2012-09-05 | Paper |
\((k,j)\)-coloring of sparse graphs
Discrete Applied Mathematics | 2012-04-30 | Paper |
\((k,1)\)-coloring of sparse graphs
Discrete Mathematics | 2012-04-13 | Paper |
Vertex decompositions of sparse graphs into an independent vertex set and a subgraph of maximum degree at most 1
Siberian Mathematical Journal | 2012-03-07 | Paper |
Acyclic 4-colorability of planar graphs without cycles of length 4 or 6
| 2012-02-20 | Paper |
2-distance 4-coloring of planar subcubic graphs
| 2012-02-20 | Paper |
Acyclic 4-coloring of planar graphs without 4- and 5-cycles
| 2012-02-20 | Paper |
Acyclic 3-choosability of planar graphs without cycles of length from 4 to 12
| 2012-02-20 | Paper |
Oriented 5-coloring of sparse plane graphs
Journal of Applied and Industrial Mathematics | 2012-02-10 | Paper |
scientific article; zbMATH DE number 6004935 (Why is no real title available?)
| 2012-02-10 | Paper |
scientific article; zbMATH DE number 6004909 (Why is no real title available?)
| 2012-02-10 | Paper |
Near-proper vertex 2-colorings of sparse graphs
| 2012-02-10 | Paper |
Sufficient conditions for the 2-distance \((\Delta+1)\)-colorability of planar graphs with girth 6
| 2012-02-10 | Paper |
List 2-facial 5-colorability of plane graphs with girth at least 12
Discrete Mathematics | 2012-01-11 | Paper |
Acyclic 5-choosability of planar graphs without 4-cycles
Siberian Mathematical Journal | 2011-10-25 | Paper |
Acyclic 5-choosability of planar graphs without adjacent short cycles
Journal of Graph Theory | 2011-10-12 | Paper |
List strong linear 2-arboricity of sparse graphs
Journal of Graph Theory | 2011-06-07 | Paper |
Injective \((\Delta + 1)\)-coloring of planar graphs with girth 6
Siberian Mathematical Journal | 2011-05-19 | Paper |
scientific article; zbMATH DE number 5875579 (Why is no real title available?)
| 2011-04-06 | Paper |
Planar graphs with neither 5-cycles nor close 3-cycles are 3-colorable
Journal of Graph Theory | 2011-01-20 | Paper |
List injective colorings of planar graphs
Discrete Mathematics | 2011-01-07 | Paper |
Vertex decompositions of sparse graphs into an edgeless subgraph and a subgraph of maximum degree at most \(k\)
Journal of Graph Theory | 2010-11-10 | Paper |
Acyclic 4-choosability of planar graphs with neither 4-cycles nor triangular 6-cycles
Discrete Mathematics | 2010-10-19 | Paper |
Planar graphs without triangles adjacent to cycles of length from 4 to 7 are 3-colorable
Discrete Mathematics | 2010-10-18 | Paper |
Acyclic 3-choosability of sparse graphs with girth at least 7
Discrete Mathematics | 2010-10-11 | Paper |
Planar graphs without 4-cycles adjacent to 3-cycles are list vertex 2-arborable
Journal of Graph Theory | 2009-12-18 | Paper |
2-distance \((\varDelta +2)\)-coloring of planar graphs with girth six and \(\varDelta \geq 18\)
Discrete Mathematics | 2009-12-15 | Paper |
Planar graphs without adjacent cycles of length at most seven are 3-colorable
Discrete Mathematics | 2009-12-15 | Paper |
Decompositions of quadrangle-free planar graphs
Discussiones Mathematicae Graph Theory | 2009-08-03 | Paper |
Planar graphs without 5- and 7-cycles and without adjacent triangles are 3-colorable
Journal of Combinatorial Theory. Series B | 2009-06-23 | Paper |
List 2-distance \((\varDelta +2)\)-coloring of planar graphs with girth six
European Journal of Combinatorics | 2009-06-17 | Paper |
M-degrees of quadrangle-free planar graphs
Journal of Graph Theory | 2009-02-20 | Paper |
Planar graphs decomposable into a forest and a matching
Discrete Mathematics | 2009-01-28 | Paper |
Minimax degrees of quasiplanar graphs with no short cycles other than triangles
Taiwanese Journal of Mathematics | 2008-09-29 | Paper |
Decomposing a planar graph with girth 9 into a forest and a matching
European Journal of Combinatorics | 2008-05-29 | Paper |
Decomposing a planar graph into a forest and a subgraph of restricted maximum degree
Sibirskie Elektronnye Matematicheskie Izvestiya | 2008-04-14 | Paper |
Minimax degrees of quasiplane graphs without 4-faces
Sibirskie Elektronnye Matematicheskie Izvestiya | 2008-04-14 | Paper |
Planar graphs without triangles adjacent to cycles of length from 3 to 9 are 3-colorable
Sibirskie Elektronnye Matematicheskie Izvestiya | 2007-07-02 | Paper |
Sufficient conditions for the minimum 2-distance colorability of plane graphs of girth 6
Sibirskie Elektronnye Matematicheskie Izvestiya | 2007-07-02 | Paper |
List \((p,q)\)-coloring of sparse plane graphs
Sibirskie Elektronnye Matematicheskie Izvestiya | 2007-07-02 | Paper |
A new upper bound on the cyclic chromatic number
Journal of Graph Theory | 2007-01-24 | Paper |
An oriented 7-colouring of planar graphs with girth at least 7
Sibirskie Elektronnye Matematicheskie Izvestiya | 2006-08-24 | Paper |
An oriented colouring of planar graphs with girth at least 4
Sibirskie Elektronnye Matematicheskie Izvestiya | 2006-08-24 | Paper |
On acyclic colorings of planar graphs. (Reprint)
Discrete Mathematics | 2006-08-04 | Paper |
2-distance coloring of sparse planar graphs
Sibirskie Elektronnye Matematicheskie Izvestiya | 2005-12-19 | Paper |
Continuation of a 3-coloring from a 7-face onto a plane graph without \(C_3\)
Sibirskie Elektronnye Matematicheskie Izvestiya | 2005-12-19 | Paper |
Sufficient conditions for planar graphs to be 2-distance (\(\Delta+1\))-colourable
Sibirskie Elektronnye Matematicheskie Izvestiya | 2005-12-12 | Paper |
Deeply asymmetric planar graphs
Journal of Combinatorial Theory. Series B | 2005-09-28 | Paper |
Planar graphs without cycles of length from 4 to 7 are 3-colorable
Journal of Combinatorial Theory. Series B | 2005-03-08 | Paper |
scientific article; zbMATH DE number 2097483 (Why is no real title available?)
| 2004-09-07 | Paper |
scientific article; zbMATH DE number 2097035 (Why is no real title available?)
| 2004-09-06 | Paper |
Homomorphisms from sparse graphs with large girth.
Journal of Combinatorial Theory. Series B | 2004-03-15 | Paper |
A sufficient condition for planar graphs to be 3-colorable
Journal of Combinatorial Theory. Series B | 2003-08-25 | Paper |
Estimating the minimal number of colors in acyclic \(k\)-strong colorings of maps on surfaces
Mathematical Notes | 2003-06-15 | Paper |
scientific article; zbMATH DE number 1882356 (Why is no real title available?)
| 2003-03-16 | Paper |
scientific article; zbMATH DE number 1882350 (Why is no real title available?)
| 2003-03-16 | Paper |
scientific article; zbMATH DE number 1882351 (Why is no real title available?)
| 2003-03-16 | Paper |
scientific article; zbMATH DE number 1882353 (Why is no real title available?)
| 2003-03-16 | Paper |
On deeply critical oriented graphs
Journal of Combinatorial Theory. Series B | 2002-12-10 | Paper |
Acyclic colouring of 1-planar graphs
Discrete Applied Mathematics | 2002-11-06 | Paper |
Acyclic list 7‐coloring of planar graphs
Journal of Graph Theory | 2002-07-11 | Paper |
Cyclic colorings of 3-polytopes with large maximum face size
SIAM Journal on Discrete Mathematics | 2002-04-23 | Paper |
The structure of the planar triangulations in terms of bundles and stars
Diskretnyĭ Analiz i Issledovanie Operatsiĭ. Seriya 1 | 2001-12-13 | Paper |
A structural property of planar graphs
Diskretnyĭ Analiz i Issledovanie Operatsiĭ. Seriya 1 | 2001-06-10 | Paper |
Weight of faces in plane maps
Mathematical Notes | 2001-04-16 | Paper |
Variable degeneracy: Extensions of Brooks' and Gallai's theorems
Discrete Mathematics | 2000-12-03 | Paper |
On universal graphs for planar oriented graphs of a given girth
Discrete Mathematics | 2000-11-02 | Paper |
Triangulated \(3\)-polytopes without faces of low weight
Discrete Mathematics | 2000-11-02 | Paper |
On kernel-perfect orientations of line graphs
Discrete Mathematics | 2000-11-02 | Paper |
Acyclic \(k\)-strong coloring of maps on surfaces
Mathematical Notes | 2000-10-16 | Paper |
Acyclic Colourings of Planar Graphs with Large Girth
Journal of the London Mathematical Society | 2000-07-04 | Paper |
scientific article; zbMATH DE number 1396798 (Why is no real title available?)
| 2000-01-31 | Paper |
Cyclic degrees of 3-polytopes
Graphs and Combinatorics | 2000-01-30 | Paper |
On cyclic colorings and their generalizations
Discrete Mathematics | 2000-01-11 | Paper |
On the maximum average degree and the oriented chromatic number of a graph
Discrete Mathematics | 1999-11-29 | Paper |
Short cycles of low weight in normal plane maps with minimum degree 5
Discussiones Mathematicae Graph Theory | 1999-11-24 | Paper |
Height of minor faces in plane normal maps
Discrete Applied Mathematics | 1999-05-10 | Paper |
scientific article; zbMATH DE number 1146221 (Why is no real title available?)
| 1998-10-19 | Paper |
scientific article; zbMATH DE number 1205984 (Why is no real title available?)
| 1998-10-04 | Paper |
Minimal vertex degree sum of a 3-path in plane maps
Discussiones Mathematicae Graph Theory | 1998-09-27 | Paper |
Total colourings of planar graphs with large girth
European Journal of Combinatorics | 1998-04-07 | Paper |
scientific article; zbMATH DE number 1109403 (Why is no real title available?)
| 1998-01-25 | Paper |
Total colorings of planar graphs with large maximum degree
| 1997-09-17 | Paper |
List edge and list total colourings of multigraphs
Journal of Combinatorial Theory. Series B | 1997-09-15 | Paper |
Cyclic degree and cyclic coloring of 3-polytopes
| 1997-06-29 | Paper |
A new proof of Grünbaum's 3 color theorem
Discrete Mathematics | 1997-06-16 | Paper |
scientific article; zbMATH DE number 919263 (Why is no real title available?)
| 1997-02-17 | Paper |
scientific article; zbMATH DE number 889952 (Why is no real title available?)
| 1997-01-13 | Paper |
Irreducible graphs in the Grünbaum-Havel 3-colour problem
Discrete Mathematics | 1996-12-08 | Paper |
Structural theorem on plane graphs with application to the entire coloring number
| 1996-11-12 | Paper |
Structural properties of plane graphs without adjacent triangles and an application to 3-colorings
| 1996-02-25 | Paper |
scientific article; zbMATH DE number 790475 (Why is no real title available?)
| 1995-08-27 | Paper |
A new proof of the 6 color theorem
Journal of Graph Theory | 1995-08-16 | Paper |
Triangles with restricted degree sum of their boundary vertices in plane graphs
Discrete Mathematics | 1995-02-06 | Paper |
On Light Edges and Triangles in Planar Graphs of Minimum Degree Five
Mathematische Nachrichten | 1995-02-02 | Paper |
scientific article; zbMATH DE number 4218321 (Why is no real title available?)
| 1995-01-01 | Paper |
Structure of neighborhoods of edges in planar graphs and simultaneous coloring of vertices, edges and faces
Mathematical Notes | 1994-07-13 | Paper |
Bidegree of graph and degeneracy number
Mathematical Notes | 1994-07-13 | Paper |
Simultaneous coloring of edges and faces of plane graphs
Discrete Mathematics | 1994-05-05 | Paper |
scientific article; zbMATH DE number 475584 (Why is no real title available?)
| 1994-01-13 | Paper |
Joint extension of two theorems of Kotzig on 3-polytopes
Combinatorica | 1993-08-16 | Paper |
Structural Properties of Planar Maps with the Minimal Degree 5
Mathematische Nachrichten | 1993-04-20 | Paper |
scientific article; zbMATH DE number 125506 (Why is no real title available?)
| 1993-02-21 | Paper |
scientific article; zbMATH DE number 125449 (Why is no real title available?)
| 1993-02-21 | Paper |
scientific article; zbMATH DE number 97631 (Why is no real title available?)
| 1993-01-17 | Paper |
Cyclic coloring of plane graphs
Discrete Mathematics | 1993-01-16 | Paper |
scientific article; zbMATH DE number 95245 (Why is no real title available?)
| 1993-01-16 | Paper |
scientific article; zbMATH DE number 58093 (Why is no real title available?)
| 1992-09-27 | Paper |
scientific article; zbMATH DE number 64356 (Why is no real title available?)
| 1992-09-27 | Paper |
Diagonal coloring of the vertices of triangulations
Discrete Mathematics | 1992-09-27 | Paper |
Decomposition of \(K_{13}\) into a torus graph and a graph imbedded in the Klein bottle
Discrete Mathematics | 1992-09-27 | Paper |
scientific article; zbMATH DE number 30974 (Why is no real title available?)
| 1992-06-28 | Paper |
Generalization of a theorem of Kotzig and a prescribed coloring of the edges of planar graphs
Mathematical Notes | 1992-06-25 | Paper |
A characterization of chromatically rigid polynomials
Siberian Mathematical Journal | 1992-06-25 | Paper |
scientific article; zbMATH DE number 4195988 (Why is no real title available?)
| 1991-01-01 | Paper |
scientific article; zbMATH DE number 4179392 (Why is no real title available?)
| 1990-01-01 | Paper |
scientific article; zbMATH DE number 4156458 (Why is no real title available?)
| 1990-01-01 | Paper |
scientific article; zbMATH DE number 4212106 (Why is no real title available?)
| 1990-01-01 | Paper |
Diagonal 11-coloring of plane triangulations
Journal of Graph Theory | 1990-01-01 | Paper |
On the total coloring of planar graphs.
Journal für die reine und angewandte Mathematik (Crelles Journal) | 1989-01-01 | Paper |
scientific article; zbMATH DE number 4135967 (Why is no real title available?)
| 1989-01-01 | Paper |
Representing of K13 as a 2-pire map on the Klein bottle.
Journal für die reine und angewandte Mathematik (Crelles Journal) | 1989-01-01 | Paper |
Solution of problems of Kotzig and Grünbaum concerning the isolation of cycles in planar graphs
Mathematical Notes | 1989-01-01 | Paper |
scientific article; zbMATH DE number 4160757 (Why is no real title available?)
| 1988-01-01 | Paper |
scientific article; zbMATH DE number 4047751 (Why is no real title available?)
| 1987-01-01 | Paper |
scientific article; zbMATH DE number 4075087 (Why is no real title available?)
| 1986-01-01 | Paper |
scientific article; zbMATH DE number 3979082 (Why is no real title available?)
| 1985-01-01 | Paper |
scientific article; zbMATH DE number 3900784 (Why is no real title available?)
| 1984-01-01 | Paper |
Proof of Simoes-Pereira's conjectures on locally k-degenerate graphs.
Journal für die reine und angewandte Mathematik (Crelles Journal) | 1980-01-01 | Paper |
On acyclic colorings of planar graphs
Discrete Mathematics | 1979-01-01 | Paper |
On an upper bound of the graph's chromatic number, depending on the graph's degree and density
Journal of Combinatorial Theory. Series B | 1977-01-01 | Paper |
scientific article; zbMATH DE number 3661375 (Why is no real title available?)
| 1976-01-01 | Paper |
scientific article; zbMATH DE number 3565019 (Why is no real title available?)
| 1976-01-01 | Paper |
scientific article; zbMATH DE number 3467133 (Why is no real title available?)
| 1974-01-01 | Paper |
