On graph equivalences preserved under extensions

Planar graphs; geometric and topological aspects of graph theory (05C10) Eulerian and Hamiltonian graphs (05C45) Coloring of graphs and hypergraphs (05C15) Graph designs and isomorphic decomposition (05C51)

Abstract: Let R be an equivalence relation on graphs. By the strengthening of R we mean the relation R' such that graphs G and H are in the relation R' if for every graph F, the union of the graphs G and F is in the relation R with the union of the graphs H and F. We study strengthenings of equivalence relations on graphs. The most important case that we consider concerns equivalence relations defined by graph properties. We obtain results on the strengthening of equivalence relations determined by the properties such as being a k-connected graph, k-colorable, hamiltonian and planar.

Recommendations

Cites work

Cited in

(7)

This page was built for publication: On graph equivalences preserved under extensions

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