Content deleted Content added
m v2.03b - Bot T18 CW#553 - WP:WCW project (<nowiki> tags) |
Citation bot (talk | contribs) Add: url, issue, s2cid. Removed URL that duplicated unique identifier. | You can use this bot yourself. Report bugs here. | Suggested by AManWithNoPlan | All pages linked from cached copy of User:AManWithNoPlan/sandbox2 | via #UCB_webform_linked |
||
Line 27:
== Disjointness graph ==
The '''disjointness graph''' of a hypergraph ''H'', denoted D(''H''), is the graph whose vertex set is the set of the hyperedges of ''H'', with two vertices adjacent in D(''H'') when their corresponding hyperedges are ''disjoint'' in ''H''.<ref>{{Cite journal|last=Meshulam|first=Roy|date=2001-01-01|title=The Clique Complex and Hypergraph Matching
== References ==
Line 46:
| title = Line graphs of hypergraphs I
| journal = [[Discrete Mathematics (journal)|Discrete Mathematics]] | volume = 18 | pages = 235–241 | year = 1977
| issue = 3
|mr=0463003 | doi = 10.1016/0012-365X(77)90127-3
}}.
*{{citation
Line 75 ⟶ 77:
| title = Recognizing intersection graphs of linear uniform hypergraphs
| journal = [[Graphs and Combinatorics]] | volume = 13 | pages = 359–367 | year = 1997
| issue = 4
|mr=1485929 | doi = 10.1007/BF03353014
}}.
*{{citation
Line 81 ⟶ 85:
| first2 = Regina | last2 = Tyshkevich
| year = 1997 | title = On line graphs of linear 3-uniform hypergraphs
| journal = Journal of Graph Theory | volume = 25 | issue = 4
| pages = 243–251 |mr=1459889 | doi = 10.1002/(SICI)1097-0118(199708)25:4<243::AID-JGT1>3.0.CO;2-K}}.
Line 101 ⟶ 106:
| title = Intersection graphs of ''k''-uniform linear hypergraphs
| journal = European Journal of Combinatorics | volume = 3 | pages = 159–172 | year = 1982
| issue = 2
|mr=0670849 | doi=10.1016/s0195-6698(82)80029-2}}.
Line 115 ⟶ 121:
| 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
|mr=2108401 | doi = 10.1007/s00373-004-0572-1
}}.
*{{citation
| |||