Some conditions for the existence of Euler \(H\)-trails

DOI10.1007/s00373-019-02066-7zbMath1429.05066OpenAlexW2968960209WikidataQ127405316 ScholiaQ127405316MaRDI QIDQ2334082

Rocío Sánchez-López, Hortensia Galeana-Sánchez, Rocío Rojas-Monroy, Juana Imelda Villarreal-Valdés

Publication date: 6 November 2019

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00373-019-02066-7

zbMATH Keywords

\(H\)-colored graph\(H\)-trailEuler \(H\)-trail

Mathematics Subject Classification ID

Paths and cycles (05C38) Coloring of graphs and hypergraphs (05C15) Eulerian and Hamiltonian graphs (05C45)

Related Items (1)

A generalization of properly colored paths and cycles in edge-colored graphs

Cites Work

• Chinese postman problem on edge-colored multigraphs
• Transforming eulerian trails
• Using matrices to link conflict evolution and resolution in a graph model
• A matrix approach to status quo analysis in the graph model for conflict resolution
• DNA physical mapping and alternating Eulerian cycles in colored graphs
• Independent restricted domination and the line digraph
• \(H\)-paths and \(H\)-cycles in \(H\)-coloured digraphs
• Restricted domination in arc-colored digraphs
• \(H\)-kernels and \(H\)-obstructions in \(H\)-colored digraphs
• Reachability problems in edge-colored digraphs
• Graphs with 1-Factors
• Matching, Euler tours and the Chinese postman
• The Orderly Colored Longest Path Problem – a survey of applications and new algorithms
• Digraphs
• Combinatorial optimization. Theory and algorithms
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Some conditions for the existence of Euler \(H\)-trails