Covering and independence in triangle structures

8Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.

Abstract

Let G be a graph in which each edge is contained in at least one triangle (complete subgraph on three vertices). We investigate relationships between the smallest cardinality of an edge set containing at least i edges of each triangle and the largest cardinality of an edge set containing at most j edges of each triangle (i, j ∈ {1, 2}), and also compare those invariants with the numbers of vertices and edges in G. Several open problems are raised in the concluding section.

Cite

CITATION STYLE

APA

Erdös, P., Gallai, T., & Tuza, Z. (1996). Covering and independence in triangle structures. Discrete Mathematics, 150(1–3), 89–101. https://doi.org/10.1016/0012-365X(95)00178-Y

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free