Editing Line graph (section)

== References ==
{{refbegin|30em}}
*{{citation
 | last = Beineke | first = L. W.
 | contribution = Derived graphs of digraphs
 | editor1-last = Sachs | editor1-first = H.
 | editor2-last = Voss | editor2-first = H.-J.
 | editor3-last = Walter | editor3-first = H.-J.
 | location = Leipzig
 | pages = 17–33
 | publisher = Teubner
 | title = Beiträge zur Graphentheorie
 | year = 1968}}.
*{{citation
 | last = Beineke | first = L. W.
 | doi = 10.1016/S0021-9800(70)80019-9
 | journal = [[Journal of Combinatorial Theory]]
 | pages = 129–135
 | title = Characterizations of derived graphs
 | volume = 9
 | year = 1970
 | mr = 0262097
 | issue = 2| doi-access = free
 }}.
*{{citation
 | last1 = Cvetković | first1 = Dragoš
 | last2 = Rowlinson | first2 = Peter
 | last3 = Simić | first3 = Slobodan
 | doi = 10.1017/CBO9780511751752
 | isbn = 0-521-83663-8
 | location = Cambridge
 | mr = 2120511
 | publisher = Cambridge University Press
 | series = London Mathematical Society Lecture Note Series
 | title = Spectral generalizations of line graphs
 | volume = 314
 | year = 2004}}.
*{{citation
 | last1 = Degiorgi | first1 = Daniele Giorgio
 | last2 = Simon | first2 = Klaus
 | contribution = A dynamic algorithm for line graph recognition
 | doi = 10.1007/3-540-60618-1_64
 | location = Berlin
 | mr = 1400011
 | pages = 37–48
 | publisher = Springer
 | series = Lecture Notes in Computer Science
 | title = Graph-theoretic concepts in computer science (Aachen, 1995)
 | volume = 1017
 | year = 1995}}.
*{{citation
 | last1 = Evans | first1 = T.S.
 | last2 = Lambiotte | first2 = R. 
 | arxiv = 0903.2181
 |  title = Line graphs, link partitions and overlapping communities
 | journal = [[Physical Review E]]
 | year = 2009
 | volume = 80
 | issue = 1
 | page = 016105
 | doi = 10.1103/PhysRevE.80.016105| pmid = 19658772
 | bibcode = 2009PhRvE..80a6105E}}.
*{{citation
 | last1 = Evans | first1 = T.S.
 | last2 = Lambiotte | first2 = R. 
 | arxiv = 0912.4389
 |  title = Line Graphs of Weighted Networks for Overlapping Communities
 | journal = [[European Physical Journal B]]
 | year = 2010
 | volume = 77
 | issue = 2
 | pages = 265–272
 | doi = 10.1140/epjb/e2010-00261-8| bibcode = 2010EPJB...77..265E| s2cid = 119504507
 }}.
*{{citation
 | last1 = Greenwell | first1 = D. L.
 | last2 = Hemminger | first2 = Robert L.
 | doi = 10.1016/0012-365X(72)90058-1
 | journal = Discrete Mathematics
 | mr = 0297604
 | pages = 31–34
 | title = Forbidden subgraphs for graphs with planar line graphs
 | volume = 2
 | year = 1972| doi-access = free
 }}.
*{{citation
 | last1 = Harary | first1 = F. | author1-link = Frank Harary
 | last2 = Norman | first2 = R. Z.
 | journal = [[Rendiconti del Circolo Matematico di Palermo]]
 | pages = 161–169
 | title = Some properties of line digraphs
 | volume = 9
 | year = 1960
 | doi = 10.1007/BF02854581
 | issue = 2| hdl = 10338.dmlcz/128114
 | s2cid = 122473974 | hdl-access = free
 }}.
*{{citation|first=F.|last=Harary|author-link=Frank Harary|title=Graph Theory|publisher=Addison-Wesley|location=Massachusetts|year=1972|url=http://www.dtic.mil/dtic/tr/fulltext/u2/705364.pdf|contribution=8. Line Graphs|pages=71–83|access-date=2013-11-08|archive-date=2017-02-07|archive-url=https://web.archive.org/web/20170207091815/http://www.dtic.mil/dtic/tr/fulltext/u2/705364.pdf}}.
*{{citation
 | last1 = Hemminger | first1 = R. L.
 | last2 = Beineke | first2 = L. W.
 | contribution = Line graphs and line digraphs
 | editor1-last = Beineke | editor1-first = L. W.
 | editor2-last = Wilson | editor2-first = R. J.
 | pages = 271–305
 | publisher = Academic Press Inc.
 | title = Selected Topics in Graph Theory
 | year = 1978}}.
*{{citation
 | last = Jung | first = H. A.
 | doi = 10.1007/BF01360250
 | journal = [[Mathematische Annalen]]
 | language = German
 | mr = 0197353
 | pages = 270–271
 | title = Zu einem Isomorphiesatz von H. Whitney für Graphen
 | volume = 164
 | year = 1966| issue = 3
 | s2cid = 119898359
 }}.
*{{citation
 | last = Krausz | first = J.
 | journal = Mat. Fiz. Lapok
 | pages = 75–85
 | title = Démonstration nouvelle d'un théorème de Whitney sur les réseaux
 | volume = 50
 | year = 1943
 | mr = 0018403}}.
*{{citation
 | last = Lehot | first = Philippe G. H.
 | doi = 10.1145/321850.321853
 | journal = [[Journal of the ACM]]
 | mr = 0347690
 | pages = 569–575
 | title = An optimal algorithm to detect a line graph and output its root graph
 | volume = 21
 | year = 1974| issue = 4
 | s2cid = 15036484
 | doi-access = free
 }}.
*{{citation
 | last = Maffray | first = Frédéric
 | doi = 10.1016/0095-8956(92)90028-V
 | issue = 1
 | journal = [[Journal of Combinatorial Theory]]
 | mr = 1159851
 | pages = 1–8
 | series = Series B
 | title = Kernels in perfect line-graphs
 | volume = 55
 | year = 1992| doi-access = free
 }}.
*{{citation
 | last1 = Metelsky | first1 = Yury
 | last2 = Tyshkevich | first2 = Regina | author2-link = Regina Tyshkevich
 | doi = 10.1002/(SICI)1097-0118(199708)25:4<243::AID-JGT1>3.0.CO;2-K
 | journal = Journal of Graph Theory
 | pages = 243–251
 | title = On line graphs of linear 3-uniform hypergraphs
 | volume = 25
 | year = 1997
 | issue = 4}}.
*{{citation
 | last1 = Ramezanpour
 | first1 = A.
 | last2 = Karimipour
 | first2 = V.
 | last3 = Mashaghi
 | first3 = A.
 | journal = Phys. Rev. E
 | page = 046107
 | title = Generating correlated networks from uncorrelated ones
 | url = http://pre.aps.org/abstract/PRE/v67/i4/e046107
 | volume = 67
 | year = 2003
 | issue = 4
 | doi = 10.1103/physreve.67.046107
 | arxiv = cond-mat/0212469
 | bibcode = 2003PhRvE..67d6107R
 | pmid = 12786436
 | s2cid = 33054818
 }}.
*{{citation
 | last1 = van Rooij | first1 = A. C. M.
 | last2 = Wilf | first2 = H. S. | author2-link = Herbert Wilf
 | doi = 10.1007/BF01904834 | doi-access = free
 | issue = 3–4
 | journal = [[Acta Mathematica Hungarica]]
 | pages = 263–269
 | title = The interchange graph of a finite graph
 | volume = 16
 | year = 1965| hdl = 10338.dmlcz/140421
 | s2cid = 122866512
 | hdl-access = free
 }}.
*{{citation
 | last = Roussopoulos | first = N. D.
 | doi = 10.1016/0020-0190(73)90029-X
 | mr = 0424435
 | issue = 4
 | journal = [[Information Processing Letters]]
 | pages = 108–112
 | title = A max {''m'',''n''} algorithm for determining the graph ''H'' from its line graph ''G''
 | volume = 2
 | year = 1973}}.
*{{citation
 | last1 = Ryjáček | first1 = Zdeněk
 | last2 = Vrána | first2 = Petr
 | doi = 10.1002/jgt.20498
 | issue = 2
 | journal = Journal of Graph Theory
 | mr = 2778727
 | pages = 152–173
 | title = Line graphs of multigraphs and Hamilton-connectedness of claw-free graphs
 | volume = 66
 | year = 2011| s2cid = 8880045
 }}.
*{{citation
 | last = Sedláček | first = J.
 | contribution = Some properties of interchange graphs
 | mr = 0173255
 | pages = 145–150
 | publisher = Publ. House Czechoslovak Acad. Sci., Prague
 | title = Theory of Graphs and its Applications (Proc. Sympos. Smolenice, 1963)
 | year = 1964}}.
*{{citation
 | last = Sysło | first = Maciej M.
 | doi = 10.1016/0020-0190(82)90080-1
 | issue = 1
 | journal = [[Information Processing Letters]]
 | mr = 678028
 | pages = 28–30
 | title = A labeling algorithm to recognize a line digraph and output its root graph
 | volume = 15
 | year = 1982}}.
*{{citation
 | last = Trotter | first = L. E. Jr.
 | doi = 10.1007/BF01593791
 | issue = 2
 | journal = Mathematical Programming
 | mr = 0457293
 | pages = 255–259
 | title = Line perfect graphs
 | volume = 12
 | year = 1977| s2cid = 38906333
 }}.
*{{citation
 | last = de Werra | first = D.
 | doi = 10.1007/BF01609025
 | issue = 2
 | journal = Mathematical Programming
 | mr = 509968
 | pages = 236–238
 | title = On line perfect graphs
 | volume = 15
 | year = 1978| s2cid = 37062237
 }}.
*{{citation
 | last = Whitney | first = H. | author-link = Hassler Whitney
 | doi = 10.2307/2371086
 | journal = American Journal of Mathematics
 | pages = 150–168
 | title = Congruent graphs and the connectivity of graphs
 | volume = 54
 | year = 1932
 | issue = 1
 | jstor = 2371086| hdl = 10338.dmlcz/101067
 | hdl-access = free
 }}.
*{{citation
 | last1 = Zhang | first1 = Fu Ji
 | last2 = Lin | first2 = Guo Ning
 | issue = 2
 | journal = Acta Math. Sinica
 | pages = 195–205
 | title = On the de Bruijn–Good graphs
 | volume = 30
 | year = 1987
 | mr = 0891925}}.
*{{citation
 | last = Зверович | first = И. Э.
 | doi = 10.4213/dm478
 | issue = 2
 | journal = Diskretnaya Matematika
 | mr = 1468075
 | pages = 98–105
 | script-title=ru:Аналог теоремы Уитни для реберных графов мультиграфов и реберные мультиграфы
 | volume = 9
 | year = 1997| language = Russian
 | doi-access = free
 }}. Translated into English as {{citation
 | last = Zverovich | first = I. È.
 | doi = 10.1515/dma.1997.7.3.287
 | issue = 3
 | journal = Discrete Mathematics and Applications
 | pages = 287–294
 | title = An analogue of the Whitney theorem for edge graphs of multigraphs, and edge multigraphs
 | volume = 7
 | year = 1997| s2cid = 120525090
 }}.
{{refend}}