Results 191 to 200 of about 850,474 (224)

Maxregularity and Maximal Outerplanar Graphs

open access: yesElectronic Notes in Discrete Mathematics, 1999
Nair Maria Maia de Abreu   +2 more
openaire   +1 more source

Bounds on the Euler Sombor index of maximal outerplanar graphs [PDF]

open access: yesElectronic Journal of Mathematics
Yifan Hu   +3 more
doaj   +1 more source

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   +5 more
semanticscholar   +1 more source

Outerplanar and Forest Storyplans

arXiv.org, 2023
We study the problem of gradually representing a complex graph as a sequence of drawings of small subgraphs whose union is the complex graph. The sequence of drawings is called \emph{storyplan}, and each drawing in the sequence is called a \emph{frame ...
Jivr'i Fiala   +4 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   +4 more
semanticscholar   +1 more source

On the Orthogonal Drawing of Outerplanar Graphs [PDF]

open access: possibleIEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, 2004
In this paper we show that an outerplanar graph G with maximum degree at most 3 has a 2-D orthogonal drawing with no bends if and only if G contains no triangles. We also show that an outerplanar graph G with maximum degree at most 6 has a 3-D orthogonal drawing with no bends if and only if G contains no triangles.
Kumiko Nomura   +2 more
openaire   +2 more sources

Home - About - Disclaimer - Privacy