Results 131 to 140 of about 4,003 (201)
Pathwidth of outerplanar graphs
We are interested in the relation between the pathwidth of a biconnected outerplanar graph and the pathwidth of its (geometric) dual. Bodlaender and Fomin, after having proved that the pathwidth of every biconnected outerplanar graph is always at most twice the pathwidth of its (geometric) dual plus two, conjectured that there exists a constant $c ...
Coudert, David+2 more
openaire +1 more source
I/O-Optimal Algorithms for Outerplanar Graphs
Anil Maheshwari, Norbert Zeh
openalex +1 more source
Erratum to “Acyclic Edge Chromatic Number of Outerplanar Graphs” [PDF]
Jianfeng Hou, Jianliang Wu
openalex +1 more source
The number of spanning trees of an infinite family of outerplanar, small-world and self-similar graphs [PDF]
Francesc Comellas+3 more
openalex +1 more source
A note on compact and compact circular edge-colorings of graphs
In the paper we study two variants of edge-coloring of edge-weighted graphs, namely compact edge-coloring and circular compact edge-coloring. First, we discuss relations between these two coloring models.
Dariusz Dereniowski, Adam Nadolski
doaj
On the outerplanar crossing numbers of complete multipartite graphs
Adrian Riskin
openalex +2 more sources
A note on the incidence coloring of outerplanar graphs
Maksim Maydanskiy
openalex +2 more sources
Structure and properties of maximal outerplanar graphs.
Benjamin Allgeier
openalex +2 more sources