Extended Double Covers and Homomorphism Bounds of Signed Graphs
Résumé
A signed graph (G, σ) is a graph G together with an assignment σ : E(G) → {+, −}. The notion of homomorphisms of signed graphs is a relatively new development which allows to strengthen the connection between the theories of minors and colorings of graphs. Following this thread of thoughts, we investigate this connection through the notion of Extended Double Covers of signed graphs, which was recently introduced by Naserasr, Sopena and Zaslavsky. More precisely, we say that a signed graph (B, π) is planar-complete if any signed planar graph (G, σ) which verifies the conditions of a basic no-homomorphism lemma with respect to (B, π) admits a homomorphism to (B, π). Our conjecture then is that: if (B, π) is a connected signed graph with no positive odd closed walk which is planar-complete, then its Extended Double Cover EDC(B, π) is also planar-complete. We observe that this conjecture largely extends the Four-Color Theorem and is strongly connected to a number of conjectures in extension of this famous theorem. A given (signed) graph (B, π) bounds a class of (signed) graphs if every (signed) graph in the class admits a homomorphism to (B, π). In this work, and in support of our conjecture, we prove it for the subclass of signed K 4-minor free graphs. Inspired by this development, we then investigate the problem of finding optimal homomorphism bounds for subclasses of signed K 4-minor-free graphs with restrictions on their girth and we present nearly optimal solutions. Our work furthermore leads to the development of weighted signed graphs.
Origine : Fichiers produits par l'(les) auteur(s)