Results 141 to 150 of about 842,964 (161)

On the Maximum Spread of Planar and Outerplanar Graphs

Zelong Li, William Linz, Linyuan Lü, Zhiyu Wang   +3 more
openalex   +1 more source

Some of the next articles are maybe not open access.

Related searches:

Using Label Information in a Genetic Programming Based Method for Acquiring Block Preserving Outerplanar Graph Patterns with Wildcards

International Workshop on Computational Intelligence and Applications, 2019
Machine learning and data mining from graph structured data have gained much attention. Many chemical compounds can be expressed by outerplanar graphs.
Fumiya Tokuhara, Shiho Okinaga, T. Miyahara, Yusuke Suzuki, T. Kuboyama, Tomoyuki Uchida   +5 more
semanticscholar   +1 more source

Acquisition of characteristic sets of block preserving outerplanar graph patterns by a two-stage evolutionary learning method for graph pattern sets

International Journal of Computational Intelligence Studies, 2018
Knowledge acquisition from graph structured data is an important task in machine learning and data mining. Block preserving outerplanar graph patterns are graph structured patterns having structured variables and are suited to represent characteristic ...
Fumiya Tokuhara, T. Miyahara, T. Kuboyama, Yusuke Suzuki, Tomoyuki Uchida   +4 more
semanticscholar   +1 more source

Bounds on the Fibonacci Number of a Maximal Outerplanar Graph

The Fibonacci quarterly, 1998
All graphs in this article are finite, undirected, without loops or multiple edges. Let G be a graph with vertices vl5 v2,..., vn. The complement in G of a subgraph H is the subgraph of G obtained by deleting all edges in H.
A. F. Alameddine
semanticscholar   +1 more source

Odd 4-Coloring of Outerplanar Graphs

Graphs Comb.
A proper $k$-coloring of $G$ is called an odd coloring of $G$ if for every vertex $v$, there is a color that appears at an odd number of neighbors of $v$.
Masaki Kashima, Xuding Zhu
semanticscholar   +1 more source

Large Induced Subgraphs of Bounded Degree in Outerplanar and Planar Graphs

arXiv.org
In this paper, we study the following question. Let $\mathcal G$ be a family of planar graphs and let $k\geq 3$ be an integer. What is the largest value $f_k(n)$ such that every $n$-vertex graph in $\mathcal G$ has an induced subgraph with degree at most
Marco D'Elia, Fabrizio Frati
semanticscholar   +1 more source

Bottleneck matrices of maximal outerplanar graphs with isomorphic underlying trees

Linear and multilinear algebra
In this paper, we consider the entries of the bottleneck matrices of maximal outerplanar graphs with isomorphic underlying trees. We show how the entries of the bottleneck matrix are perturbed when we modify a maximal outerplanar graph into a ...
Jason J. Molitierno
semanticscholar   +1 more source