Results 211 to 220 of about 850,474 (224)

The decycling number of outerplanar graphs

Journal of Combinatorial Optimization, 2012
For a graph G, let ?(G) be the decycling number of G and c(G) be the number of vertex-disjoint cycles of G. It has been proved that c(G)≤?(G)≤2c(G) for an outerplanar graph G. An outerplanar graph G is called lower-extremal if ?(G)=c(G) and upper-extremal if ?(G)=2c(G).
Min-Yun Lien, Hung-Lin Fu, Huilan Chang
openaire   +2 more sources

Characterization of Outerplanar Graphs Whose Second Largest Eigenvalue is at Most 1

Results in Mathematics, 2023
Shuchao Li, Wanting Sun
semanticscholar   +1 more source

Acquisition of Characteristic Block Preserving Outerplanar Graph Patterns by Genetic Programming Using Label Information

IIAI International Conference on Advanced Applied Informatics, 2016
Fumiya Tokuhara, T. Miyahara, Yusuke Suzuki, Tomoyuki Uchida, T. Kuboyama   +4 more
semanticscholar   +1 more source

Using canonical representations of block tree patterns in acquisition of characteristic block preserving outerplanar graph patterns

International Workshop on Computational Intelligence and Applications, 2016
Fumiya Tokuhara, T. Miyahara, Yusuke Suzuki, Tomoyuki Uchida, T. Kuboyama   +4 more
semanticscholar   +1 more source

Acquisition of multiple block preserving outerplanar graph patterns by an evolutionary method for graph pattern sets

International Workshop on Computational Intelligence and Applications, 2017
Fumiya Tokuhara, T. Miyahara, T. Kuboyama, Yusuke Suzuki, Tomoyuki Uchida   +4 more
semanticscholar   +1 more source

Acquisition of characteristic block preserving outerplanar graph patterns from positive and negative data using Genetic Programming and tree representation of graph patterns

International Workshop on Computational Intelligence and Applications, 2015
Yuto Ouchiyama, T. Miyahara, Yusuke Suzuki, Tomoyuki Uchida, T. Kuboyama, Fumiya Tokuhara   +5 more
semanticscholar   +1 more source

Independent covers in outerplanar graphs

1988
A subset U of vertices of a plane graph is said to be a perfect face-independent vertex cover (FIVC) if and only if each face has exactly one vertex in U. Necessary and sufficient conditions for a maximal plane graph to have a perfect FIVC are derived.
Maciej M. Sysło, Pawel Winter
openaire   +2 more sources

Graph Pattern Matching with Expressive Outerplanar Graph Patterns

, 2011
Hitoshi Yamasaki, Takashi Yamada, Takayoshi Shoudai   +2 more
semanticscholar   +1 more source

Mining of Frequent Externally Extensible Outerplanar Graph Patterns

2008 Seventh International Conference on Machine Learning and Applications, 2008
Hitoshi Yamasaki, Takayoshi Shoudai
semanticscholar   +1 more source

Enumerating Global Roundings of an Outerplanar Graph

International Symposium on Algorithms and Computation, 2003
Nadia Takki-Chebihi, T. Tokuyama
semanticscholar   +1 more source