An algorithm to recognize a middle graph

DOI10.1016/0166-218X(84)90067-2MaRDI QIDQ786829zbMATH OpenOpenAlexFDO

Authors Miroslawa Skowronska, Maciej M. Sysło

Publication date 1984

Published in Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0166-218x(84)90067-2

zbMATH Keywords

intersection graphmiddle graph

Mathematics Subject Classification ID

Structural characterization of families of graphs (05C75) Algorithms in computer science (68W99)

Cites work

• scientific article; zbMATH DE number 3520451 (Why is no real title available?)
• A \(max \{m, n \}\) algorithm for determining the graph H from its line graph G
• A recognition algorithm for the total graphs
• An Optimal Algorithm to Detect a Line Graph and Output Its Root Graph
• Parallel concepts in graph theory
• Traversability and connectivity of the middle graph of a graph

Cited in

(4)

• A labeling algorithm to recognize a line digraph and output its root graph
• Strong cliques in diamond-free graphs
• Infinite \(\Phi\)-periodic graphs
• The total graph of a hypergraph

This page was built for publication: An algorithm to recognize a middle graph

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q786829)