Revision as of 01:04, 7 June 2008 edit JRN08 (talk \| contribs) 1,116 edits m →References spell the name the way it is in the original printout of the publications ← Previous edit		Revision as of 14:32, 25 June 2008 edit undo 138.92.14.30 (talk) →Line graphs of k-uniform hypergraphs, k ≥ 3 Next edit →
Line 9: {{harvtxt\|Beineke\|1968}} characterized line graphs of graphs by a list of 9 forbidden induced subgraphs. (See the article on [[line graph]]s.) No characterization by forbidden induced subgraphs is known of line graphs of k-uniform hypergraphs for any ''k'' ≥ 3, and {{harvtxt\|Lóvász\|1977}} showed there is no such characterization by a finite list if ''k'' = 3. {{harvtxt\|Krausz\|1943}} characterized line graphs of graphs in terms of [[clique (graph theory)\|clique]] covers. (See ~~the~~[[Line_graph#Characterization_and_recognition\|Line ~~article on line graphs~~Graphs]].) A global characterization of Krausz type for the line graphs of ''k''-uniform hypergraphs for any ''k'' ≥ 3 was given by {{harvtxt\|Berge\|1989}}. ==Line graphs of ''k''-uniform linear hypergraphs, ''k'' ≥ 3==

Line graph of a hypergraph: Difference between revisions