Results 101 to 110 of about 211 (163)
Reconstruction of maximal outerplanar graphs
Discrete Mathematics, 1972 AbstractS. Ulam has conjectured that every graph with three or more points is uniquely determined by its collection of point-deleted subgraphs. This has been proved for various classes of graphs, but progress has generally been confined to very symmetrical graphs and graphs with connectivity zero or one.
openaire +2 more sources
Clustering systems of phylogenetic networks. [PDF]
Theory Biosci, 2023 Hellmuth M, Schaller D, Stadler PF.
europepmc +1 more source
The Canadian Traveller Problem on outerplanar graphs
CoRRWe study the $k$-Canadian Traveller Problem, where a weighted graph $G=(V,E,ω)$ with a source $s\in V$ and a target $t\in V$ are given. This problem also has a hidden input $E_* \subsetneq E$ of cardinality at most $k$ representing blocked edges. The objective is to travel from $s$ to $t$ with the minimum distance.
Laurent Beaudou +7 more
openaire +4 more sources
Rainbow subgraphs in edge-colored planar and outerplanar graphs [PDF]
Discrete Mathematics Letters, 2023 Július Czap
doaj +1 more source
Structure Properties of Generalized Farey graphs based on Dynamical Systems for Networks. [PDF]
Sci Rep, 2018 Jiang W, Zhai Y, Martin P, Zhao Z.
europepmc +1 more source
Comparison and enumeration of chemical graphs. [PDF]
Comput Struct Biotechnol J, 2013 Akutsu T, Nagamochi H.
europepmc +1 more source
Finding Cactus Roots in Polynomial Time. [PDF]
Theory Comput Syst, 2018 Golovach PA +3 more
europepmc +1 more source
Charge group partitioning in biomolecular simulation. [PDF]
J Comput Biol, 2013 Canzar S +7 more
europepmc +1 more source
Twisted Ways to Find Plane Structures in Simple Drawings of Complete Graphs. [PDF]
Discrete Comput GeomAichholzer O +4 more
europepmc +1 more source