Abstract
Every graph G may be transformed into a covering graph either by deletion of edges or by subdivision. Let Π E (G) and Π V (G) denote corresponding minimal numbers. We prove Π E (G) = Π V (G) for every graph G.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
J. Nešetřil, Complexity of diagrams, Order (to appear).
S.Poljak and D.Turzík (1982) A polynomial algorithm for constructing a large bipartite subgraph, with an application to a satisfiability problem. Can. J. Math. 34, 519–524.
P.Turán (1941) Eine extremale Aufgabe aus der Graphentheorie, Mat. Fis. Lapok 48, 436–452.
Author information
Authors and Affiliations
Additional information
Communicated by I. Rival
Rights and permissions
About this article
Cite this article
Holub, P. A remark on covering graphs. Order 2, 321–322 (1985). https://doi.org/10.1007/BF00333136
Received:
Accepted:
Issue Date:
DOI: https://doi.org/10.1007/BF00333136