Links in edge-colored graphs
From MaRDI portal
Publication:966157
DOI10.1016/j.ejc.2009.03.021zbMath1210.05035MaRDI 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
05C15: Coloring of graphs and hypergraphs
Related Items
Generalized matrix projective synchronization of general colored networks with different-dimensional node dynamics, Adaptive synchronization and pinning control of colored networks
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