Existence of graphs with a given set of r-neighborhoods

DOI10.1016/0095-8956(83)90016-3zbMath0517.05056OpenAlexW2079721544MaRDI QIDQ1053037

Peter M. Winkler

Publication date: 1983

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0095-8956(83)90016-3

zbMATH Keywords

cycle-lengthdegree sets of k-treesr-neighborhoodrooted subgraphs

Mathematics Subject Classification ID

Hypergraphs (05C65) Graph theory (05C99)

Related Items (2)

A Characterization of the degree sequences of 2-trees ⋮ Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• Higher-dimensional tree structures. I
• Degree sets of k-trees: Small k
• On acyclic simplicial complexes
• Properties and characterizations of k ‐trees
• A variant of a recursively unsolvable problem

This page was built for publication: Existence of graphs with a given set of r-neighborhoods