Name
Abstract | ||
|---|---|---|
Introduced implicitly by Brualdi and Massey (Discret Math 122(1---3):51---58, 1993) in their work on the strong chromatic index of multigraphs, the arc incidence graph AI(G) of a graph G is defined as the square of the line graph of the incidence graph of G. We describe a linear-time algorithm for recognizing arc incidence graphs and reconstructing a graph with no isolated vertices from its arc incidence graph. |
Year | DOI | Venue |
|---|---|---|
2012 | 10.1007/s00373-011-1073-7 | Graphs and Combinatorics |
Keywords | Field | DocType |
arc incidence graph,incidence coloring conjecture,incidence graph,reconstruction algorithm | Discrete mathematics,Topology,Combinatorics,Line graph,Graph power,Quartic graph,Simplex graph,Null graph,Butterfly graph,Mathematics,Voltage graph,Complement graph | Journal |
Volume | Issue | ISSN |
28 | 5 | 1435-5914 |
Citations | PageRank | References |
1 | 0.41 | 8 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Stephen G. Hartke | 1 | 159 | 24.56 |
| Geir T. Helleloid | 2 | 10 | 1.73 |