Results 131 to 140 of about 850,474 (224)
Clustering systems of phylogenetic networks. [PDF]
Hellmuth M, Schaller D, Stadler PF.
europepmc +1 more source
k-Colored Point-Set Embeddability of Outerplanar Graphs [PDF]
Emilio Di Giacomo+5 more
openalex +1 more source
Constant Approximation Algorithms for Embedding Graph Metrics into Trees and Outerplanar Graphs [PDF]
Victor Chepoi+4 more
openalex +1 more source
Algebraic characterizations of outerplanar and planar graphs
AbstractA drawing of a graph in the plane is even if nonadjacent edges have an even number of intersections. Hanani’s theorem characterizes planar graphs as those graphs that have an even drawing. In this paper we present an algebraic characterization of graphs that have an even drawing.
openaire +3 more sources
The Tutte polynomial characterizes simple outerplanar graphs [PDF]
Andrew Goodall+3 more
openalex +1 more source
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
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
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