Line graph of a hypergraph: Difference between revisions

Revision as of 05:38, 13 April 2008

Revision as of 05:52, 13 April 2008

Line 44:

| first = C. | last = Berge | authorlink = Claude Berge

| title = Hypergraphs: Combinatorics of Finite Sets

| ___location = Amsterdam | publisher = North-Holland | year = 1989}}.

| id = {{MathSciNet | id = 1013569}}}}. Translated from the French.

*{{citation

Line 51 ⟶ 52:

| first3 = D. | last3 = Sotteau

| title = Line graphs of hypergraphs I

| journal = Discrete Mathematics | volume = 18 | pages = 235–241 | year = 1977}}

| id = {{MathSciNet | id = 0463003}} | doi = 10.1016/0012-365X(77)90127-3}}.

*{{citation

| first1 = M. C. | last1 = Heydemann

| first2 = D. | last2 = Sotteau

| titlecontribution = Line graphs of hypergraphs II

| title = Combinatorics (Proc. Fifth Hungarian Colloq., Keszthely, 1976)

| journalseries = Colloq. Math. Soc. J. Bolyai

| volume = 18 | pages = 567–582 | year = 1976 | id = {{MathSciNet | id = 0519291}}}}.

*{{citation

Line 78 ⟶ 81:

| first3 = Jeno | last3 = Lehel

| title = Recognizing intersection graphs of linear uniform hypergraphs

| journal = Graphs and Combinatorics | volume = 13 | pages = 359–367 | year = 1997}}.

| id = {{MathSciNet | id = 1485929}}}}.

*{{citation

Line 84 ⟶ 88:

| first2 = Regina | last2 = Tyshkevich

| year = 1997 | title = On line graphs of linear 3-uniform hypergraphs

| journal = Journal of Graph Theory | volume = 25 | pages = 243–251}}.

| id = {{MathSciNet | id = 1459889}} | doi = 10.1002/(SICI)1097-0118(199708)25:4<243::AID-JGT1>3.0.CO;2-K}}.

*{{citation

Line 91 ⟶ 96:

| first3 = S. S. | last3 = Shrikhande | authorlink3 = S. S. Shrikhande

| first4 = N. M. | last4 = Singhi

| titlecontribution = Intersection graphs of ''k''-uniform hypergraphs

| title = Combinatorial mathematics, optimal designs and their applications (Proc. Sympos. Combin. Math. and Optimal Design, Colorado State Univ., Fort Collins, Colo., 1978)

| journalseries = Annals of Discrete Mathematics | volume = 6 | pages = 275–279 | year = 1980}}.

| id = {{MathSciNet | id = 0593539}}}}.

*{{citation

Line 100 ⟶ 107:

| first4 = N. M. | last4 = Singhi

| title = Intersection graphs of ''k''-uniform hypergraphs

| journal = European J. Combinatorics | volume = 3 | pages = 159–172 | year = 1982}}.

| id = {{MathSciNet | id = 0670849}}}}.

*{{citation

| first1 = P. V. | last1 = Skums

| first2 = S. V. | last2 = Suzdal'

| first3 = R. I. | last3 = Tyshkevich

| title = Edge intersection of linear 3-unform hypergraphs

Line 112 ⟶ 120:

*{{citation

| first = Igor E. | last = Zverovich

| title = A solution to a problem of Jacobson, Kézdy and LethelLehel

| journal = Graphs and Combinatorics | volume = 20 | issue = 4 | year = 2004 | pages = 571–577

| id = {{MathSciNet | id = 2108401}} | doi = 10.1007/s00373-004-0572-1}}.

[[Category:Graph families]]