Reconstructing a graph from its arc incidence graph
type: Item
instance of: scholarly article
title: Reconstructing a graph from its arc incidence graph
zbMATH Open document ID: 1256.05152
author: Stephen G. Hartke
author: Geir T. Helleloid
published in: Graphs and Combinatorics
publication date: 2012-12-27T00:00:00Z
Mathematics Subject Classification ID: 05C60
Mathematics Subject Classification ID: 05C85
zbMATH DE Number: 6118531
zbMATH Keywords: arc incidence graph
zbMATH Keywords: incidence graph
zbMATH Keywords: incidence coloring conjecture
zbMATH Keywords: reconstruction algorithm
MaRDI profile type: Publication
full work available at URL: s00373-011-1073-7
OpenAlex ID: W2032820658
cites work: Characterizations of derived graphs
cites work: Incidence and strong edge colorings of graphs
cites work: On Hamiltonian Line-Graphs
cites work: Q3651735
cites work: On Eulerian and Hamiltonian Graphs and Line Graphs
cites work: Some properties of line digraphs
cites work: Q5345642
cites work: Incidence coloring of \(k\)-degenerated graphs
cites work: Q5837982
cites work: An Optimal Algorithm to Detect a Line Graph and Output Its Root Graph
cites work: The incidence coloring conjecture for graphs of maximum degree 3
cites work: A \(max \{m, n \}\) algorithm for determining the graph H from its line graph G
cites work: A labeling algorithm to recognize a line digraph and output its root graph
cites work: The interchange graph of a finite graph
cites work: A note on incidence graphs
cites work: Q3070286
DOI: 10.1007/S00373-011-1073-7
description: scientific article; zbMATH DE number 6118531