research
∙
03/09/2020
Complexity of tree-coloring interval graphs equitably
An equitable tree-k-coloring of a graph is a vertex k-coloring such that...
share
research
∙
08/14/2019
Equitable partition of graphs into induced linear forests
It is proved that the vertex set of any simple graph G can be equitably ...
research
∙
08/14/2019
Light edges in 1-planar graphs of minimum degree 3
A graph is 1-planar if it can be drawn in the plane so that each edge is...
research
∙
08/14/2019
Equitable tree-O(d)-coloring of d-degenerate graphs
An equitable tree-k-coloring of a graph is a vertex coloring on k colors...
research
∙
08/14/2019
Equitable vertex arboricity of d-degenerate graphs
A minimization problem in graph theory so-called the equitable tree-colo...
research
∙
03/20/2019
Equitable partition of plane graphs with independent crossings into induced forests
The cluster of a crossing in a graph drawing on the plane is the set of ...
research
∙
02/24/2019
A structure of 1-planar graph and its applications to coloring problems
A graph is 1-planar if it can be drawn on a plane so that each edge is c...
research
∙
09/08/2018