Results 111 to 120 of about 11,526 (190)

Recognizing the P 4-structure of claw-free graphs and a larger graph class

open access: yesDiscrete Mathematics & Theoretical Computer Science, 2002
The P 4-structure of a graph G is a hypergraph H on the same vertex set such that four vertices form a hyperedge in H whenever they induce a P 4 in G.
Luitpold Babel   +2 more
doaj  

Strategy evolution on temporal hypergraphs. [PDF]

open access: yesProc Natl Acad Sci U S A
Wang X, Zhou L, McAvoy A, Tian Z, Li A.
europepmc   +1 more source

Rumor propagation on hypergraphs. [PDF]

open access: yesNat Commun
Oliveira KA   +3 more
europepmc   +1 more source

Testing Quantum Satisfiability. [PDF]

open access: yesCommun Math Phys
Montanaro A, Shao C, Verdon D, Verdon D.
europepmc   +1 more source

Matrix-based pagerank control in hypergraphs for semantic text summaries. [PDF]

open access: yesSci Rep
Aleja D   +3 more
europepmc   +1 more source

Home - About - Disclaimer - Privacy