Face size and the maximum genus of a graph. II: Nonsimple graphs
Face-width of embedded graphs
Finite planar vertex-transitive graphs of the regularity degree three
Finite Vertex-Transitive Planar Graphs of the Regularity Degree Four or Five
Fixed simplex property for retractable complexes.
Fixed-point-free embeddings of graphs in their complements.
Flexibility of embeddings of bouquets of circles on the projective plane and Klein bottle.
Folding on the wedge sum of graphs and their fundamental group.
Forbidden Structures for Planar Perfect Consecutively Colourable Graphs
A consecutive colouring of a graph is a proper edge colouring with posi- tive integers in which the colours of edges incident with each vertex form an interval of integers. The idea of this colouring was introduced in 1987 by Asratian and Kamalian under the name of interval colouring. Sevast- janov showed that the corresponding decision problem is NP-complete even restricted to the class of bipartite graphs. We focus our attention on the class of consecutively colourable graphs whose all induced...
Front-divisors of trees.
Fully dynamic 3-dimensional orthogonal graph drawing.
Functigraphs: An extension of permutation graphs
Let and be copies of a graph , and let be a function. Then a functigraph is a generalization of a permutation graph, where and . In this paper, we study colorability and planarity of functigraphs.