ACTIN
发表于 2025-3-25 06:43:02
Generalizations of Digraphs,t some results remain the same with respect to their formulation, but their proofs become much more involved. Other results do not hold any more. This gives an additional insight to the theory of digraphs. In particular, we can more clearly see which properties of digraphs allow us to obtain various results on them.
同位素
发表于 2025-3-25 10:19:30
https://doi.org/10.1007/978-1-4471-3886-0Applications; Directed Graphs; Notation; Theory; algorithms; diagraphs; flows and connectivity; graph; graph
模范
发表于 2025-3-25 12:50:18
http://reply.papertrans.cn/29/2805/280433/280433_23.png
BILL
发表于 2025-3-25 18:12:25
Markus Strauch,Andreas Schröer,Björn SchmitzIn this chapter we will consider the hamiltonian path and cycle problems for digraphs as well as some related problems such as the longest path and cycle problems and the minimum path factor problem. We describe and prove a number of results in the area as well as formulate several open questions.
debris
发表于 2025-3-25 21:15:39
https://doi.org/10.1007/978-3-531-94105-9In this chapter we discuss results which in one way or another generalize the notion of hamiltonicity. As can be seen from the content of the chapter, there are quite a number of such topics. In fact many more could be added, but we feel that the ones included here are representative.
Tidious
发表于 2025-3-26 00:34:05
http://reply.papertrans.cn/29/2805/280433/280433_26.png
Esophagus
发表于 2025-3-26 04:55:28
Hamiltonian Refinements,In this chapter we discuss results which in one way or another generalize the notion of hamiltonicity. As can be seen from the content of the chapter, there are quite a number of such topics. In fact many more could be added, but we feel that the ones included here are representative.
龙虾
发表于 2025-3-26 10:25:25
http://reply.papertrans.cn/29/2805/280433/280433_28.png
Infelicity
发表于 2025-3-26 13:16:06
http://reply.papertrans.cn/29/2805/280433/280433_29.png
alleviate
发表于 2025-3-26 20:46:27
Gruppenstruktur und Interaktionsprozeßingle tool for applications of digraphs and perhaps even of graphs as a whole. At the same time, from a theoretical point of view, flow problems constitute a beautiful common generalization of shortest path problems and problems such as finding internally (arc)-disjoint paths from a given vertex to