Results 121 to 130 of about 3,724 (174)

Matching Complexes of Outerplanar Graphs

open access: yes
An outerplanar graph is a planar graph that has a planar drawing with all vertices on the unbounded face. The matching complex of a graph is the simplicial complex whose faces are subsets of disjoint edges of the graph. In this paper we prove that the matching complexes of outerplanar graphs are contractible or homotopy equivalent to a wedge of spheres.
Bayer, Margaret   +2 more
openaire   +2 more sources

Network Pollution Games. [PDF]

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

Comparison and enumeration of chemical graphs. [PDF]

open access: yesComput Struct Biotechnol J, 2013
Akutsu T, Nagamochi H.
europepmc   +1 more source

Charge group partitioning in biomolecular simulation. [PDF]

open access: yesJ Comput Biol, 2013
Canzar S   +7 more
europepmc   +1 more source

Finding Cactus Roots in Polynomial Time. [PDF]

open access: yesTheory Comput Syst, 2018
Golovach PA   +3 more
europepmc   +1 more source

Straight Skeletons and Mitered Offsets of Nonconvex Polytopes. [PDF]

open access: yesDiscrete Comput Geom, 2016
Aurenhammer F, Walzl G.
europepmc   +1 more source

The multi-stripe travelling salesman problem. [PDF]

open access: yesAnn Oper Res, 2017
Çela E, Deineko VG, Woeginger GJ.
europepmc   +1 more source

Home - About - Disclaimer - Privacy