Results 121 to 130 of about 3,724 (174)
Matching Complexes of Outerplanar Graphs
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
Structure Properties of Generalized Farey graphs based on Dynamical Systems for Networks. [PDF]
Jiang W, Zhai Y, Martin P, Zhao Z.
europepmc +1 more source
Comparison and enumeration of chemical graphs. [PDF]
Akutsu T, Nagamochi H.
europepmc +1 more source
Charge group partitioning in biomolecular simulation. [PDF]
Canzar S +7 more
europepmc +1 more source
Finding Cactus Roots in Polynomial Time. [PDF]
Golovach PA +3 more
europepmc +1 more source
Leveraging graphical model techniques to study evolution on phylogenetic networks. [PDF]
Teo B, Bastide P, Ané C.
europepmc +1 more source
Straight Skeletons and Mitered Offsets of Nonconvex Polytopes. [PDF]
Aurenhammer F, Walzl G.
europepmc +1 more source
Distinction of Chaos from Randomness Is Not Possible from the Degree Distribution of the Visibility and Phase Space Reconstruction Graphs. [PDF]
Angelidis AK +6 more
europepmc +1 more source
The multi-stripe travelling salesman problem. [PDF]
Çela E, Deineko VG, Woeginger GJ.
europepmc +1 more source

