Results 151 to 160 of about 1,405,425 (255)

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  

The Laplacian of a uniform hypergraph

open access: yesJournal of combinatorial optimization, 2015
Shenglong Hu, L. Qi
semanticscholar   +1 more source

Home - About - Disclaimer - Privacy