Alternating Eulerian trails with prescribed degrees in two edge-colored complete graphs

DOI10.1016/0012-365X(83)90016-XzbMath0494.05020OpenAlexW2087020374MaRDI QIDQ1168977

S. Singh

Publication date: 1983

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0012-365x(83)90016-x

zbMATH Keywords

colored graphsvertex-degreesconnected spanning subgraph

Mathematics Subject Classification ID

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

Related Items (8)

Alternating cycles and paths in edge-coloured multigraphs: A survey ⋮ Almost Eulerian compatible spanning circuits in edge-colored graphs ⋮ Graphs and degree sequences. I ⋮ Maximum \((g,f)\)-factors of a general graph ⋮ On supereulerian 2-edge-coloured graphs ⋮ On s-t paths and trails in edge-colored graphs ⋮ Alternating cycles and trails in \(2\)-edge-coloured complete multigraphs ⋮ On connectivities of edge-colored graphs

Cites Work

• Graphs with cycles having adjacent lines different colors
• Characterization of self-complementary graphs with 2-factors
• Solution of the Hamiltonian problem for self-complementary graphs
• Graphs with Hamiltonian cycles having adjacent lines different colours
• On factorable degree sequences
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Alternating Eulerian trails with prescribed degrees in two edge-colored complete graphs