Results 21 to 30 of about 45 (34)

A Finite Characterization and Recognition of Intersection Graphs of Hypergraphs with Rank at Most 3 and Multiplicity at Most 2 in the Class of Threshold Graphs

open access: yesDiscussiones Mathematicae Graph Theory, 2017
We characterize the class L32$L_3^2 $ of intersection graphs of hypergraphs with rank at most 3 and multiplicity at most 2 by means of a finite list of forbidden induced subgraphs in the class of threshold graphs.
Metelsky Yury   +2 more
doaj   +1 more source

Requiring that Minimal Separators Induce Complete Multipartite Subgraphs

open access: yesDiscussiones Mathematicae Graph Theory, 2018
Complete multipartite graphs range from complete graphs (with every partite set a singleton) to edgeless graphs (with a unique partite set). Requiring minimal separators to all induce one or the other of these extremes characterizes, respectively, the ...
McKee Terry A.
doaj   +1 more source

The classification of partially symmetric 3-braid links

open access: yesOpen Mathematics, 2015
We classify 3-braid links which are amphicheiral as unoriented links, including a new proof of Birman- Menasco’s result for the (orientedly) amphicheiral 3-braid links. Then we classify the partially invertible 3-braid links.
Stoimenov Alexander
doaj   +1 more source

Sharp Upper Bounds on the Clar Number of Fullerene Graphs

open access: yesDiscussiones Mathematicae Graph Theory, 2018
The Clar number of a fullerene graph with n vertices is bounded above by ⌊n/6⌋ − 2 and this bound has been improved to ⌊n/6⌋ − 3 when n is congruent to 2 modulo 6.
Gao Yang, Zhang Heping
doaj   +1 more source

Archimedean tiling graphs with Gallai’s property

open access: yesAnalele Stiintifice ale Universitatii Ovidius Constanta: Seria Matematica, 2017
Gallai in 1966 raised the question about the existence of graphs with the property that every vertex is missed by some longest path. This property will be called Gallai’s property.
Chang Zhikui, Yuan Liping
doaj   +1 more source

Combinatorial Properties and Recognition of Unit Square Visibility Graphs. [PDF]

open access: yesDiscrete Comput Geom, 2023
Casel K   +4 more
europepmc   +1 more source

Best match graphs and reconciliation of gene trees with species trees. [PDF]

open access: yesJ Math Biol, 2020
Geiß M   +6 more
europepmc   +1 more source

Minimum triplet covers of binary phylogenetic X-trees. [PDF]

open access: yesJ Math Biol, 2017
Huber KT, Moulton V, Steel M.
europepmc   +1 more source

RIGID GRAPH COMPRESSION: MOTIF-BASED RIGIDITY ANALYSIS FOR DISORDERED FIBER NETWORKS. [PDF]

open access: yesMultiscale Model Simul, 2018
Heroy S   +4 more
europepmc   +1 more source

Universal Completability, Least Eigenvalue Frameworks, and Vector Colorings. [PDF]

open access: yesDiscrete Comput Geom, 2017
Godsil C   +4 more
europepmc   +1 more source

Home - About - Disclaimer - Privacy