Line graphs and digraphs
| dc.contributor.advisor | Kozerenko, Sergey | |
| dc.contributor.author | Dekhtiar, Bohdan-Yarema | |
| dc.date.accessioned | 2024-04-15T10:47:45Z | |
| dc.date.available | 2024-04-15T10:47:45Z | |
| dc.date.issued | 2022 | |
| dc.description.abstract | We give the most widely used characterization of line graphs, along with the characterization of line graphs of trees. We go on to Whitney isomorphism theorem, which shows that the root graph of a line graph is unique (with 1 exception), characterization of graphs isomorphic to their line graphs, and several results about bipartite graphs. | en_US |
| dc.identifier.uri | https://ekmair.ukma.edu.ua/handle/123456789/28974 | |
| dc.language.iso | en | en_US |
| dc.status | first published | en_US |
| dc.subject | line graphs | en_US |
| dc.subject | main results | en_US |
| dc.subject | definitions | en_US |
| dc.subject | курсова робота | en_US |
| dc.title | Line graphs and digraphs | en_US |
| dc.type | Other | en_US |