Revision as of 12:34, 12 April 2008 edit Tangi-tamma (talk \| contribs) 1,091 edits m →I propse for a cleanup if possible - keep it open for 2 weeks ← Previous edit		Revision as of 15:25, 12 April 2008 edit undo Tangi-tamma (talk \| contribs) 1,091 edits m →Line graphs of k-uniform hypergraphs, k ≥ 3 Edit Next edit →
Line 6: ==Line graphs of ''k''-uniform hypergraphs, ''k'' ≥ 3== Beineke (1968) characterized line graphs of graphs by a list of 9 forbidden induced subgraphs (~~see~~See the article on [[~~Line~~line graph]]s.). No characterization by forbidden induced subgraphs is known of line graphs of k-uniform hypergraphs for any k ≥ 3, and Lóvász (1977) showed there is no such characterization by a finite list if k = 3. Krausz (1943) characterized line graphs of graphs in terms of [[clique]] covers (See the article on line graphs.).

Line graph of a hypergraph: Difference between revisions