Article
Licensed
Unlicensed
Requires Authentication
Line hypergraphs
-
A.G. Levin
Published/Copyright:
February 2, 2016
Abstract
The notion of the line hypergraph is introduced. It is an immediate generalization of two wellknown objects: a line graph and a dual hypergraph. We obtain various characterizations of line hypergraphs; we also obtain a generalization of Whitney's theorem. The NP-completeness of the problem of determining whether a given graph is the line graph of a hypergraph of rank r > 2 is proved.
Published Online: 2016-2-2
Published in Print: 1993-1-1
© 2016 by Walter de Gruyter Berlin/Boston
You are currently not able to access this content.
You are currently not able to access this content.
Articles in the same Issue
- Editorial
- The Steiner problem: a survey
- Exponents of classes of non-negative matrices
- Algebraic operations and identities generated by Grassmann's algebras
- Expansion of even permutations into two factors of the given cyclic structure
- Line hypergraphs
- On the number of threshold functions
- Large deviations of the height of a random tree
- Theorems on large deviations in the polynomial scheme of trials
- Forthcoming Papers
- Contents
Articles in the same Issue
- Editorial
- The Steiner problem: a survey
- Exponents of classes of non-negative matrices
- Algebraic operations and identities generated by Grassmann's algebras
- Expansion of even permutations into two factors of the given cyclic structure
- Line hypergraphs
- On the number of threshold functions
- Large deviations of the height of a random tree
- Theorems on large deviations in the polynomial scheme of trials
- Forthcoming Papers
- Contents
