Locally linear graph: Difference between revisions

Revision as of 20:59, 5 September 2019

Revision as of 11:03, 4 April 2020

Line 130:

| last3 = Seidel | first3 = J. J.

| doi = 10.1016/B978-0-7204-2262-7.50008-9

| journal = A surveySurvey of combinatorialCombinatorial theoryTheory (Proc. Internat. Sympos., Colorado State Univ., Fort Collins, Colo., 1971)

| mr = 0364015

| pages = 25–30

| publisher = North-Holland | ___location = Amsterdam

| title = A strongly regular graph derived from the perfect ternary Golay code

| year = 1973| isbn = 9780720422627 }}</ref>

<ref name=f>{{citation

Line 144:

| pages = 3–6

| title = Locally linear graphs

| url = https://hdl.handle.net/10338.dmlcz/136481

| volume = 39

| year = 1989}}<| hdl = 10338.dmlcz/ref>136481

| year = 2017}}</ref>

<ref name=fan>{{citation

Line 204:

| title = On line graphs of subcubic triangle-free graphs

| volume = 340

| year = 2017| url = https://pure.qub.ac.uk/en/publications/on-line-graphs-of-subcubic-trianglefree-graphs(aa6963d5-59e6-4d92-a9d6-d89d4374396c).html

| year = 2017}}</ref>

}}</ref>

<ref name=rs>{{citation

Line 225 ⟶ 226:

| pages = 99–103

| title = Polytopic locally linear graphs

| url = https://hdl.handle.net/10338.dmlcz/133017

| volume = 38

| year = 1988}}<| hdl = 10338.dmlcz/ref>133017

}}</ref>

<ref name=zd>{{citation