Links in edge-colored graphs

DOI10.1016/j.ejc.2009.03.021zbMath1210.05035OpenAlexW1976664607MaRDI QIDQ966157

M. Dah, Jean-Michel Bécu, Gervais Mendy, Yannis Manoussakis

Publication date: 27 April 2010

Published in: European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejc.2009.03.021

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items (3)

Generalized matrix projective synchronization of general colored networks with different-dimensional node dynamics ⋮ Adaptive synchronization and pinning control of colored networks ⋮ Parallel connectivity in edge-colored complete graphs: complexity results

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• \(k\)-linked and \(k\)-cyclic digraphs
• The directed subgraph homeomorphism problem
• Disjoint paths in graphs
• Alternating Hamiltonian cycles
• Graph minors. IX: Disjoint crossed paths
• Alternating paths in edge-colored complete graphs
• DNA physical mapping and alternating Eulerian cycles in colored graphs
• On Sufficient Degree Conditions for a Graph to be $k$-linked
• Linkedness and Ordered Cycles in Digraphs
• Graph folding and programmable logic array
• A Polynomial Solution to the Undirected Two Paths Problem
• Hamiltonian problems in edge-colored complete graphs and eulerian cycles in edge-colored graphs : some complexity results

This page was built for publication: Links in edge-colored graphs