Line graph of a hypergraph: Difference between revisions

Content deleted Content added
Added the missing word "linear" to the Naik, Rao, Shrikhande, Singhi paper.
m References: replace mr template with mr parameter in CS1 templates; using AWB
Line 41:
| title = Hypergraphs: Combinatorics of Finite Sets
| ___location = Amsterdam | publisher = North-Holland | year = 1989
| id mr= {{MathSciNet | id = 1013569}}}}. Translated from the French.
 
*{{citation
Line 49:
| title = Line graphs of hypergraphs I
| journal = [[Discrete Mathematics (journal)|Discrete Mathematics]] | volume = 18 | pages = 235–241 | year = 1977
| id mr= {{MathSciNet | id = 0463003}} | doi = 10.1016/0012-365X(77)90127-3}}.
 
*{{citation
Line 57:
| title = Combinatorics (Proc. Fifth Hungarian Colloq., Keszthely, 1976)
| series = Colloq. Math. Soc. J. Bolyai
| volume = 18 | pages = 567–582 | year = 1976 | id mr= {{MathSciNet | id = 0519291}}}}.
 
*{{citation
Line 63:
| 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 mr= {{MathSciNet | id = 0018403}}}}. (In Hungarian, with French abstract.)
 
*{{citation
Line 78:
| title = Recognizing intersection graphs of linear uniform hypergraphs
| journal = Graphs and Combinatorics | volume = 13 | pages = 359–367 | year = 1997
| id mr= {{MathSciNet | id = 1485929}}}}.
 
*{{citation
Line 85:
| year = 1997 | title = On line graphs of linear 3-uniform hypergraphs
| journal = Journal of Graph Theory | volume = 25 | pages = 243–251
| id mr= {{MathSciNet | id = 1459889}} | doi = 10.1002/(SICI)1097-0118(199708)25:4<243::AID-JGT1>3.0.CO;2-K}}.
 
*{{citation
Line 95:
| title = Combinatorial mathematics, optimal designs and their applications (Proc. Sympos. Combin. Math. and Optimal Design, Colorado State Univ., Fort Collins, Colo., 1978)
| series = Annals of Discrete Mathematics | volume = 6 | pages = 275–279 | year = 1980
| id mr= {{MathSciNet | id = 0593539}}}}.
 
*{{citation
Line 104:
| title = Intersection graphs of ''k''-uniform linear hypergraphs
| journal = European J. Combinatorics | volume = 3 | pages = 159–172 | year = 1982
| id mr= {{MathSciNet | id = 0670849}} | doi=10.1016/s0195-6698(82)80029-2}}.
 
*{{citation
Line 118:
| title = A solution to a problem of Jacobson, Kézdy and Lehel
| journal = Graphs and Combinatorics | volume = 20 | issue = 4 | year = 2004 | pages = 571–577
| id mr= {{MathSciNet | id = 2108401}} | doi = 10.1007/s00373-004-0572-1}}.
 
*{{citation
Line 124:
| title = Introduction to Graph and Hypergraph Theory
| ___location = New York | publisher = Nova Science Publishers, Inc. | year = 2009
| id mr= {{MathSciNet | id = 2514872}}}}
 
[[Category:Graph families]]