Alternating walks in partially 2-edge-colored graphs and optimal strength of graph labeling

DOI10.1016/S0012-365X(98)00148-4zbMath0934.05056MaRDI QIDQ1297493

Chi Wang, André E. Kézdy

Publication date: 10 April 2000

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

zbMATH Keywords

polynomial-time algorithmgraph labelingedge-labelingalternating walkpartially 2-edge-colored graphregularizable index

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Paths and cycles (05C38) Coloring of graphs and hypergraphs (05C15) Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (3)

Coloring graphs to produce properly colored walks ⋮ Properly colored trails, paths, and bridges ⋮ Fork-forests in bi-colored complete bipartite graphs

Cites Work

• Matching theory
• Regularisable graphs I
• Regularisable graphs, II
• An efficiently solvable graph partition problem to which many problems are reducible
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Alternating walks in partially 2-edge-colored graphs and optimal strength of graph labeling