We study the existence of certain disjoint paths in planar graphs and generalize a theorem of Thomassen on planarizing cycles in surfaces. Results are used to prove that every 5-connected ...
The second path matrix S(G) collects all the second paths in the graph G. Its characteristic polynomial shows some regularity in several particular graphs, such as paths, cycles, stars and complete ...
Abstract: Shortest path mining is one of the classic problems in graph theory. How to design an efficient multi-source shortest paths mining algorithm has practical significance. In this article, an ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback