Results 141 to 150 of about 10,088 (246)

On 3-Coloring of ( 2 P 4 , C 5 )-Free Graphs. [PDF]

open access: yesAlgorithmica, 2022
Jelínek V   +4 more
europepmc   +1 more source

Laboratory earthquakes decipher control and stability of rupture speeds. [PDF]

open access: yesNat Commun, 2023
Dong P   +4 more
europepmc   +1 more source

Clustering systems of phylogenetic networks. [PDF]

open access: yesTheory Biosci, 2023
Hellmuth M, Schaller D, Stadler PF.
europepmc   +1 more source

Minimal vertex Ramsey graphs and minimal forbidden subgraphs

open access: bronze, 2004
Marta Borowiecka-Olszewska   +2 more
openalex   +1 more source

Characterization and recognition of edge intersection graphs of trichromatic hypergraphs with finite multiplicity in the class of split graphs

open access: yesInformatika, 2018
A hypergraph is called k-chromatic if its vertex set can be partitioned into at most k pairwise disjoint subsets when each subset has no more than two common vertices with every edge of the hypergraph.
T. V. Lubasheva
doaj  

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

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

Home - About - Disclaimer - Privacy