Author:
Ando Kiyoshi,Egawa Yoshimi,Kaneko Atsushi,Kawarabayashi Ken-ichi,Matsuda Haruhide
Subject
Discrete Mathematics and Combinatorics,Theoretical Computer Science
Cited by
29 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Spanning k-trees and distance signless Laplacian spectral radius of graphs;Discrete Applied Mathematics;2024-12
2. Spanning k-trees and distance spectral radius in graphs;The Journal of Supercomputing;2024-07-17
3. Some existence theorems on path-factor critical avoidable graphs;RAIRO - Operations Research;2024-03
4. Tight toughness bounds for path-factor critical avoidable graphs;AKCE International Journal of Graphs and Combinatorics;2024-02-26
5. Degree sum and restricted {P2,P5}-factor in graphs;Proceedings of the Romanian Academy, Series A: Mathematics, Physics, Technical Sciences, Information Science;2023-06-28