A recognition algorithm for the total graphs

From MaRDI portal

Publication:4148016

Jump to:navigation, search

DOI10.1002/net.3230080205zbMath0369.05048OpenAlexW2021818872MaRDI QIDQ4148016

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)

Related Items (6)

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

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

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:4148016&oldid=17951273"