Line graph of a hypergraph: Difference between revisions

Revision as of 04:44, 13 April 2008

Revision as of 05:38, 13 April 2008

Line 32:

==References==

*{{citation

* L. W. Beineke (1968), On derived graphs and digraphs. In: Beitrage zur Graphentheorie [H. Saks et al., eds.], Teubner, Leipzig, pp. 17-23.

| first = L. W. | last = Beineke

| contribution = On derived graphs and digraphs

| title = Beitrage zur Graphentheorie

| editor1-first = H. | editor1-last = Sachs

| editor2-first = H. | editor2-last = Voss

| editor3-first = H. | editor3-last = Walther

| publisher = Teubner | ___location = Leipzig | pages = 17–23 | year = 1968}}.

*{{citation

* C. Berge, 1989, ''Hypergraphs: Combinatorics of Finite Sets''. Amsterdam: North-Holland.

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

* C. | Berge,title 1989,= ''Hypergraphs: Combinatorics of Finite Sets''. Amsterdam: North-Holland.

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

*{{citation

* J.C. Bermond, M.C. Heydemann, and D. Sotteau (1977), Line graphs of hypergraphs I. ''Discrete Mathematics'', vol. 18, pp. 235-241.

| first1 = J. C. | last1 = Bermond

| first2 = M. C. | last2 = Heydemann

| first3 = D. | last3 = Sotteau

| title = Line graphs of hypergraphs I

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

*{{citation

* M. C. Heydemann and D. Scotteau (1976), Line graphs of hypergraphs II. In Colloq. Math. Soc. J. Bolyai, vol. 18, pp. 567-582

| first1 = M. C. | last1 = Heydemann

| first2 = D. | last2 = Sotteau

| title = Line graphs of hypergraphs II

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

| volume = 18 | pages = 567–582 | year = 1976}}.

*{{citation

* J. Krausz (1943), Demonstration nouvelle d'un theorem de Whitney sur les reseaux. ''Mat. Fiz. Lapok'', vol. 50, pp. 75-89

| last = Krausz | first = J.

| title = Démonstration nouvelle d'une théorème de Whitney sur les réseaux

| journal = Mat. Fiz. Lapok | volume = 50 | year = 1943 | pages = 75–85

| id = {{MathSciNet | id = 0018403}}}}. (In Hungarian, with French abstract.)

*{{citation

* L. Lóvász. Problem 9. in: ''Beitrage zur Graphentheorie und deren Ansendungen''. Vortgetragen auf dem international Colloquium in Oberhof (DDR) (1977), p. 313.

| first = L. | last = Lóvász | authorlink = László Lovász

| contribution = Problem 9

| title = Beitrage zur Graphentheorie und deren Ansendungen

| series = Vortgetragen auf dem international Colloquium in Oberhof (DDR)

| year = 1977 | page = 313}}.

*{{citation

* M S. Jacobson, Andre E. Kezdy, and Jeno Lehel (1997), Recognizing Intersection Graphs of Linear Uniform Hypergraphs. ''Graphs and Combinatorics'', vol. 13, pp. 359-367.

| first1 = M. S. | last1 = Jacobson

| first2 = Andre E. | last2 = Kézdy

| first3 = Jeno | last3 = Lehel

| title = Recognizing intersection graphs of linear uniform hypergraphs

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

*{{citation

* Yury Metelsky and Regina Tyshkevich (1997), On line graphs of linear 3-uniform hypergraphs. ''J. of Graph Theory'', vol. 25, pp. 243-251.

| first1 = Yury | last1 = Metelsky

| 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}}.

*{{citation

* R. N. Naik, S. B. Rao, S. S. Shrikhande, and N. M. Singhi (1980), Intersection graphs of k-uniform hypergraphs. ''Annals of Discrete Mathematics'', vol. 6, pp. 275-279.

| first1 = R. N. | last1 = Naik

| first2 = S. B. | last2 = Rao

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

| first4 = N. M. | last4 = Singhi

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

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

*{{citation

* R. N. Naik, S. B. Rao, S. S. Shrikhande, and N. M. Singhi (1982), Intersection graphs of k-uniform linear hypergraphs. ''European J. Combinatorics'', vol. 3, pp. 159-172.

| first1 = R. N. | last1 = Naik

| first2 = S. B. | last2 = Rao

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

| first4 = N. M. | last4 = Singhi

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

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

*{{citation

* P.V. Skums, S.V. Suzdal and R.I. Tyshkevich, Edge intersection of linear 3-unform hypergraphs, Mechanics and Mathematics faculty, Belarus State University, Minsk, Belarus – October 2005

| first1 = P. V. | last1 = Skums

| first2 = S. V. | last2 = Suzdal

* Igor E. Zverovich (2004), A solution to a problem of Jacobson, Kezdy and Lethel, DIMACS Publications. pp. 1-7.

| first3 = R. I. | last3 = Tyshkevich

| title = Edge intersection of linear 3-unform hypergraphs

| journal = Electronic Notes in Discrete Mathematics

| volume = 22 | pages = 33–40 | year = 2005 | doi = 10.1016/j.endm.2005.06.007}}.

*{{citation

| first = Igor E. | last = Zverovich

* Igor | E.title Zverovich (2004),= A solution to a problem of Jacobson, KezdyKézdy and Lethel, DIMACS Publications. pp. 1-7.

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

| doi = 10.1007/s00373-004-0572-1}}.

[[Category:Graph families]]