A recognition algorithm for the total graphs

DOI10.1002/NET.3230080205MaRDI QIDQ4148016zbMATH OpenOpenAlexFDO

Authors Fanica Gavril

Publication date 1978

Published in Networks (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/net.3230080205

Mathematics Subject Classification ID

Graph theory (05C99) Algorithms in computer science (68W99)

Cited in

(6)

• Approximation hardness of edge dominating set problems
• The algorithmic complexity of mixed domination in graphs
• EULERIAN AND HAMILTONIAN PROPERTIES OF GALLAI AND ANTI-GALLAI TOTAL GRAPHS
• Succinct data structure for path graphs
• An algorithm to recognize a middle graph
• The total graph of a hypergraph

This page was built for publication: A recognition algorithm for the total graphs

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