Anna O. Ivanova

,

Discret. Math., 2025

All tight descriptions of faces in plane triangulations with minimum degree 4.

[BibT_eX]

[DOI]

,

Discuss. Math. Graph Theory, 2024

Tight description of faces of triangulations on the torus.

[BibT_eX]

[DOI]

,

Discret. Math., September, 2023

Another tight description of faces in plane triangulations with minimum degree 4.

[BibT_eX]

[DOI]

,

Discret. Math., 2022

3-Vertices with fewest 2-neighbors in plane graphs with no long paths of 2-vertices.

[BibT_eX]

[DOI]

,

Discret. Math., 2022

Almost all about light neighborhoods of 5-vertices in 3-polytopes with minimum degree 5.

[BibT_eX]

[DOI]

,

Discret. Math., 2022

All tight descriptions of 3-paths in plane graphs with girth at least 7.

[BibT_eX]

[DOI]

,

Discret. Math., 2021

Light minor 5-stars in 3-polytopes with minimum degree 5 and no 6-vertices.

[BibT_eX]

[DOI]

,

,

Ekaterina I. Vasil'eva

Discuss. Math. Graph Theory, 2020

Low 5-stars at 5-vertices in 3-polytopes with minimum degree 5 and no vertices of degree from 7 to 9.

[BibT_eX]

[DOI]

,

Mikhail A. Bykov

,

Discuss. Math. Graph Theory, 2020

Describing the neighborhoods of 5-vertices in 3-polytopes with minimum degree 5 and no vertices of degree from 6 to 8.

[BibT_eX]

[DOI]

,

,

Olesy N. Kazak

Discret. Math., 2019

Describing faces in 3-polytopes with no vertices of degree from 5 to 7.

[BibT_eX]

[DOI]

,

Discret. Math., 2019

An improvement of Lebesgue's description of edges in 3-polytopes and faces in plane quadrangulations.

[BibT_eX]

[DOI]

,

Discret. Math., 2019

Describing neighborhoods of 5-vertices in 3-polytopes with minimum degree 5 and without vertices of degrees from 7 to 11.

[BibT_eX]

[DOI]

,

,

Olesy N. Kazak

Discuss. Math. Graph Theory, 2018

More about the height of faces in 3-polytopes.

[BibT_eX]

[DOI]

,

Mikhail A. Bykov

,

Discuss. Math. Graph Theory, 2018

Heights of minor 5-stars in 3-polytopes with minimum degree 5 and no vertices of degree 6 and 7.

[BibT_eX]

[DOI]

,

,

Olesy N. Kazak

,

Ekaterina I. Vasil'eva

Discret. Math., 2018

All one-term tight descriptions of 3-paths in normal plane maps without K4-e.

[BibT_eX]

[DOI]

,

Discret. Math., 2018

Low minor faces in 3-polytopes.

[BibT_eX]

[DOI]

,

Discret. Math., 2018

Tight Descriptions of 3-Paths in Normal Plane Maps : Dedicated to Andre Raspaud on the occasion of his 70th birthday.

[BibT_eX]

[DOI]

,

,

J. Graph Theory, 2017

A Steinberg-Like Approach to Describing Faces in 3-Polytopes.

[BibT_eX]

[DOI]

,

Tsyndyma Chimit-Dordjievna Batueva

,

Ekaterina I. Vasil'eva

Graphs Comb., 2017

All Tight Descriptions of 4-Paths in 3-Polytopes with Minimum Degree 5.

[BibT_eX]

[DOI]

,

,

Graphs Comb., 2017

All tight descriptions of 3-stars in 3-polytopes with girth 5.

[BibT_eX]

[DOI]

,

Discuss. Math. Graph Theory, 2017

Low minor 5-stars in 3-polytopes with minimum degree 5 and no 6-vertices.

[BibT_eX]

[DOI]

,

,

D. V. Nikiforov

Discret. Math., 2017

On light neighborhoods of 5-vertices in 3-polytopes with minimum degree 5.

[BibT_eX]

[DOI]

,

Discret. Math., 2017

Low 5-stars in normal plane maps with minimum degree 5.

[BibT_eX]

[DOI]

,

Tsyndyma Chimit-Dordjievna Batueva

Discret. Math., 2017

Refined weight of edges in normal plane maps.

[BibT_eX]

[DOI]

,

,

,

,

,

Discret. Math., 2017

On the weight of minor faces in triangle-free polytopes.

[BibT_eX]

[DOI]

,

Discuss. Math. Graph Theory, 2016

An extension of Kotzig's Theorem.

[BibT_eX]

[DOI]

V. A. Aksenov

,

,

Discuss. Math. Graph Theory, 2016

Weight of edges in normal plane maps.

[BibT_eX]

[DOI]

,

Discret. Math., 2016

Low stars in normal plane maps with minimum degree 4 and no adjacent 4-vertices.

[BibT_eX]

[DOI]

,

Discret. Math., 2016

The weight of faces in normal plane maps.

[BibT_eX]

[DOI]

,

Discret. Math., 2016

An analogue of Franklin's Theorem.

[BibT_eX]

[DOI]

,

Discret. Math., 2016

Every Triangulated 3-Polytope of Minimum Degree 4 has a 4-Path of Weight at Most 27.

[BibT_eX]

[DOI]

,

Electron. J. Comb., 2016

Low edges in 3-polytopes.

[BibT_eX]

[DOI]

,

Discret. Math., 2015

Describing tight descriptions of 3-paths in triangle-free normal plane maps.

[BibT_eX]

[DOI]

,

Discret. Math., 2015

Weight of 3-Paths in Sparse Plane Graphs.

[BibT_eX]

[DOI]

V. A. Aksenov

,

,

Electron. J. Comb., 2015

5-stars of low weight in normal plane maps with minimum degree 5.

[BibT_eX]

[DOI]

,

,

Tommy R. Jensen

Discuss. Math. Graph Theory, 2014

Light C4 and C5 in 3-polytopes with minimum degree 5.

[BibT_eX]

[DOI]

,

,

Douglas R. Woodall

Discret. Math., 2014

Describing faces in plane triangulations.

[BibT_eX]

[DOI]

,

,

Discret. Math., 2014

Every 3-polytope with minimum degree 5 has a 6-cycle with maximum degree at most 11.

[BibT_eX]

[DOI]

,

,

Discret. Math., 2014

Acyclic 4-Choosability of Planar Graphs with No 4- and 5-Cycles.

[BibT_eX]

[DOI]

,

J. Graph Theory, 2013

Precise upper bound for the strong edge chromatic number of sparse planar graphs.

[BibT_eX]

[DOI]

,

Discuss. Math. Graph Theory, 2013

Describing 3-paths in normal plane maps.

[BibT_eX]

[DOI]

,

,

Tommy R. Jensen

,

,

Matthew P. Yancey

Discret. Math., 2013

Describing 3-faces in normal plane maps with minimum degree 4.

[BibT_eX]

[DOI]

,

Discret. Math., 2013

Describing 4-stars at 5-vertices in normal plane maps with minimum degree 5.

[BibT_eX]

[DOI]

,

Discret. Math., 2013

Describing (d-2)-stars at d-vertices, d≤5, in normal plane maps.

[BibT_eX]

[DOI]

,

Discret. Math., 2013

2-distance 4-colorability of planar subcubic graphs with girth at least 22.

[BibT_eX]

[DOI]

,

Discuss. Math. Graph Theory, 2012

(k, 1)-coloring of sparse graphs.

[BibT_eX]

[DOI]

,

,

,

Discret. Math., 2012

Acyclic 4-choosability of planar graphs without adjacent short cycles.

[BibT_eX]

[DOI]

,

Discret. Math., 2012

List 2-facial 5-colorability of plane graphs with girth at least 12.

[BibT_eX]

[DOI]

,

Discret. Math., 2012

Acyclic 5-choosability of planar graphs without adjacent short cycles.

[BibT_eX]

[DOI]

,

J. Graph Theory, 2011

List strong linear 2-arboricity of sparse graphs.

[BibT_eX]

[DOI]

,

J. Graph Theory, 2011

List injective colorings of planar graphs.

[BibT_eX]

[DOI]

,

Discret. Math., 2011

(k, j)-coloring of sparse graphs.

[BibT_eX]

[DOI]

,

,

,

Discret. Appl. Math., 2011

Vertex decompositions of sparse graphs into an edgeless subgraph and a subgraph of maximum degree at most k.

[BibT_eX]

[DOI]

,

,

,

,

J. Graph Theory, 2010

Acyclic 4-choosability of planar graphs with neither 4-cycles nor triangular 6-cycles.

[BibT_eX]

[DOI]

,

,

André Raspaud

Discret. Math., 2010

Acyclic 3-choosability of sparse graphs with girth at least 7.

[BibT_eX]

[DOI]

,

,

,

Discret. Math., 2010

Planar graphs without 4-cycles adjacent to 3-cycles are list vertex 2-arborable.

[BibT_eX]

[DOI]

,

J. Graph Theory, 2009

List 2-distance (Delta+2)-coloring of planar graphs with girth six.

[BibT_eX]

[DOI]

,

Eur. J. Comb., 2009

Decompositions of quadrangle-free planar graphs.

[BibT_eX]

[DOI]

,

,

,

Naeem N. Sheikh

Discuss. Math. Graph Theory, 2009

Planar graphs decomposable into a forest and a matching.

[BibT_eX]

[DOI]

,

,

,

Naeem N. Sheikh

Discret. Math., 2009

2-distance (Delta+2)-coloring of planar graphs with girth six and Delta>=18.

[BibT_eX]

[DOI]

,