\(H\)-paths and \(H\)-cycles in \(H\)-coloured digraphs
From MaRDI portal
Publication:2345526
DOI10.1007/s00373-013-1395-8zbMath1312.05062MaRDI QIDQ2345526
Ingrid Torres-Ramos, Hortensia Galeana-Sánchez
Publication date: 22 May 2015
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00373-013-1395-8
kernel; \(H\)-coloured digraph; \(H\)-kernel by paths; \(H\)-semikernel by paths \(\mod D_1\); \(H\)-separation; \(H\)-subdivision of \(C_3\); \(H\)-subdivision of \(P_3\)
05C38: Paths and cycles
05C15: Coloring of graphs and hypergraphs
05C20: Directed graphs (digraphs), tournaments
Related Items
Some conditions for the existence of Euler \(H\)-trails, A generalization of properly colored paths and cycles in edge-colored graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On kernels by monochromatic paths in the corona of digraphs
- On kernel-perfect critical digraphs
- On monochromatic paths in m-coloured tournaments
- On monochromatic paths in edge-coloured digraphs
- Extending kernel perfect digraphs to kernel perfect critical digraphs
- Some operations preserving the existence of kernels
- On \((k,l)\)-kernels in generalized products
- Kernels in edge-colored digraphs
- A counterexample to a conjecture on edge-coloured tournaments
- On monochromatic paths and monochromatic cycles in edge coloured tournaments
- Recent problems and results about kernels in directed graphs
- Reachability problems in edge-colored digraphs
- Monochromatic paths and monochromatic sets of arcs in quasi-transitive digraphs
- Monochromatic cycles and monochromatic paths in arc-colored digraphs
- Counterexamples of the 0-1 Law for Fragments of Existential Second-Order Logic: an Overview
