Finding paths in graphs avoiding forbidden transitions
- 1 March 2003
- journal article
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 126 (2-3) , 261-273
- https://doi.org/10.1016/s0166-218x(02)00251-2
Abstract
No abstract availableKeywords
This publication has 8 references indexed in Scilit:
- Extremal Graph TheoryPublished by Springer Nature ,2017
- Alternating cycles and trails in 2-edge-coloured complete multigraphsDiscrete Mathematics, 1998
- Compatible 2-factorsDiscrete Applied Mathematics, 1992
- On circuit decomposition of planar Eulerian graphsJournal of Combinatorial Theory, Series B, 1990
- Compatible path-cycle-decompositions of plane graphsJournal of Combinatorial Theory, Series B, 1987
- Data Structures and Network AlgorithmsPublished by Society for Industrial & Applied Mathematics (SIAM) ,1983
- On Two Problems in the Generation of Program Test PathsIEEE Transactions on Software Engineering, 1976
- A Short Proof of the Factor Theorem for Finite GraphsCanadian Journal of Mathematics, 1954