Results 131 to 140 of about 850,474 (224)

Clustering systems of phylogenetic networks. [PDF]

open access: yesTheory Biosci, 2023
Hellmuth M, Schaller D, Stadler PF.
europepmc   +1 more source

k-Colored Point-Set Embeddability of Outerplanar Graphs [PDF]

open access: bronze, 2007
Emilio Di Giacomo   +5 more
openalex   +1 more source

Constant Approximation Algorithms for Embedding Graph Metrics into Trees and Outerplanar Graphs [PDF]

open access: bronze, 2011
Victor Chepoi   +4 more
openalex   +1 more source

Algebraic characterizations of outerplanar and planar graphs

open access: yesEuropean Journal of Combinatorics, 2007
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]

open access: green, 2011
Andrew Goodall   +3 more
openalex   +1 more source

Pathwidth of outerplanar graphs

open access: yes, 2006
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

A note on compact and compact circular edge-colorings of graphs

open access: yesDiscrete Mathematics & Theoretical Computer Science, 2008
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  

Home - About - Disclaimer - Privacy