Acyclicity in edge-colored graphs
From MaRDI portal
Publication:2374151
DOI10.1016/j.disc.2016.07.012zbMath1351.05075arXiv1601.01824OpenAlexW2963476366MaRDI QIDQ2374151
Publication date: 14 December 2016
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1601.01824
Related Items
A classification of edge-colored graphs based on properly colored walks, Odd properly colored cycles in edge-colored graphs, A new sufficient condition for the existence of alternating Hamiltonian cycles in 2-edge-colored multigraphs, Acyclic Digraphs
Cites Work
- Unnamed Item
- Unnamed Item
- Chinese postman problem on edge-colored multigraphs
- Properly colored paths and cycles
- An NP-complete matching problem
- Alternating cycles in edge-partitioned graphs
- Hamiltonian circuits determining the order of chromosomes
- A note on alternating cycles in edge-coloured graphs
- DNA physical mapping and alternating Eulerian cycles in colored graphs
- Paths and trails in edge-colored graphs
- Cycles and paths in edge‐colored graphs with given degrees
- Graph folding and programmable logic array
- Total Ordering Problem
- An Edge-Colored Version of Dirac's Theorem
- A Dirac Type Condition for Properly Coloured Paths and Cycles
- Parameterized Algorithms
- Digraphs