Finding paths in graphs avoiding forbidden transitions-Reference-Cited by-同舟云学术

Finding paths in graphs avoiding forbidden transitions

Published:2003-03 Issue:2-3 Volume:126 Page:261-273
ISSN:0166-218X
Container-title:Discrete Applied Mathematics
language:en
Short-container-title:Discrete Applied Mathematics

Author:

Szeider Stefan

Publisher

Elsevier BV

Subject

Applied Mathematics,Discrete Mathematics and Combinatorics

Reference13 articles.

1. Alternating cycles and trails in 2-edge-coloured complete multigraphs;Bang-Jensen;Discrete Math.,1998

2. Digraphs: Theory, Algorithms, Applications, Monographs in Mathematics;Bang-Jensen,2000

3. R. Diestel, Graph theory, 2nd Edition, Graduate Texts in Mathematics, Vol. 173, Springer, New York, 2000.

4. H. Fleischner, personal communication.

5. H. Fleischner, Eulerian Graphs and Related Topics, Part 1, Vol. 1, Annals of Discrete Mathematics, Vol. 45, Elsevier Science Publishers, North-Holland, Amsterdam, 1990.

Cited by 47 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Trails in arc-colored digraphs avoiding forbidden transitions;Discrete Mathematics Letters;2024-04-03

2. Solve the Constrained Shortest Path Problem Using an Improved A* Algorithm;2024 7th International Conference on Advanced Algorithms and Control Engineering (ICAACE);2024-03-01

3. On the Routing Problems in Graphs with Ordered Forbidden Transitions;Lecture Notes in Computer Science;2023-12-09

4. The Fine-Grained Complexity of Approximately Counting Proper Connected Colorings (Extended Abstract);Combinatorial Optimization and Applications;2023-12-09

5. A Heuristic Algorithm to Solve the Shortest Path Problem with Constraints;2023 9th International Conference on Computer and Communications (ICCC);2023-12-08