Vertex graph theory - Open Access .click

Results 221 to 230 of about 199,356 (251)

Spanning Plane Subgraphs of 1‐Plane Graphs

Journal of Graph Theory, EarlyView.
ABSTRACT A graph drawn on the plane is called 1‐plane if each edge is crossed at most once by another edge. In this paper, we show that every 4‐edge‐connected 1‐plane graph has a connected spanning plane subgraph. We also show that there exist infinitely many 4‐connected 1‐plane graphs that have no 2‐connected spanning plane subgraphs.
Kenta Noguchi, Katsuhiro Ota, Yusuke Suzuki +2 more
wiley +1 more source

Asymptotic Enumeration of Normal and Hybridization Networks via Tree Decoration. [PDF]

Bull Math Biol
Fuchs M, Steel M, Zhang Q.
europepmc +1 more source

Recognizing Trees From Incomplete Decks

Journal of Graph Theory, EarlyView.
ABSTRACT Given a graph G $G$, the unlabeled subgraphs G − v $G-v$ are called the cards of G $G$. The deck of G $G$ is the multiset { G − v : v ∈ V ( G ) } $\{G-v:v\in V(G)\}$. Wendy Myrvold showed that a disconnected graph and a connected graph both on n $n$ vertices have at most ⌊ n 2 ⌋ + 1 $\lfloor \frac{n}{2}\rfloor +1$ cards in common and found ...
Gabriëlle Zwaneveld
wiley +1 more source

Delocalisation and Continuity in 2D: Loop O ( 2 ) , Six-Vertex, and Random-Cluster Models. [PDF]

Commun Math Phys
Glazman A, Lammers P.
europepmc +1 more source

Maximum independent set in multiplex social networks and its application to influence maximization. [PDF]