Euler dynamic H -trails in edge-colored graphs
From MaRDI portal
Publication:6651158
DOI10.1080/09728600.2023.2250837MaRDI QIDQ6651158
H. Galeana-Sánchez, Carlos Vilchis-Alfaro
Publication date: 10 December 2024
Published in: AKCE International Journal of Graphs and Combinatorics (Search for Journal in Brave)
Graph theory (including graph drawing) in computer science (68R10) Coloring of graphs and hypergraphs (05C15) Eulerian and Hamiltonian graphs (05C45)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- \(H\)-kernels in infinite digraphs
- Hamiltonian circuits determining the order of chromosomes
- Independent restricted domination and the line digraph
- On supereulerian 2-edge-coloured graphs
- Compatible spanning circuits in edge-colored graphs
- Almost Eulerian compatible spanning circuits in edge-colored graphs
- Characterization of color patterns by dynamic \(H\)-paths
- Some conditions for the existence of Euler \(H\)-trails
- Restricted domination in arc-colored digraphs
- The Orderly Colored Longest Path Problem – a survey of applications and new algorithms
- On Eulerian and Hamiltonian Graphs and Line Graphs
- The Factorization of Linear Graphs
This page was built for publication: Euler dynamic H -trails in edge-colored graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6651158)
