Results 131 to 140 of about 4,003 (201)

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  

Network Pollution Games. [PDF]

open access: yesAlgorithmica, 2019
Anastasiadis E   +5 more
europepmc   +1 more source

Are RNA networks scale-free? [PDF]

open access: yesJ Math Biol, 2020
Clote P.
europepmc   +1 more source

Home - About - Disclaimer - Privacy