Results 301 to 310 of about 565,580 (311)
Some of the next articles are maybe not open access.
Robust line segment matching via reweighted random walks on the homography graph
Pattern Recognition, 2021Yongjun Zhang, Chang Li
exaly
1992
Following ideas of \textit{P. A. Catlin} [J. Graph Theory 12, No. 1, 29-45 (1988; Zbl 0659.05073)] and using a previous result of his own in a submitted paper, the author proves: If \(G\) is a 3-edge connected simple triangle-free graph on \(n\) vertices with minimum degree \(\delta(G)\geq 4\) such that for the degrees the condition \((*)\) \(d(u)+ d(v)
openaire +1 more source
Following ideas of \textit{P. A. Catlin} [J. Graph Theory 12, No. 1, 29-45 (1988; Zbl 0659.05073)] and using a previous result of his own in a submitted paper, the author proves: If \(G\) is a 3-edge connected simple triangle-free graph on \(n\) vertices with minimum degree \(\delta(G)\geq 4\) such that for the degrees the condition \((*)\) \(d(u)+ d(v)
openaire +1 more source
Internally disjoint trees in the line graph and total graph of the complete bipartite graph
Applied Mathematics and Computation, 2022Shu-Li Zhao, Rong-Xia Hao
exaly
Kirchhoff index in line, subdivision and total graphs of a regular graph
Discrete Applied Mathematics, 2012Xing Gao, Yanfeng Luo
exaly
The generalized connectivity of the line graph and the total graph for the complete bipartite graph
Applied Mathematics and Computation, 2019Yinkui Li
exaly
The upper bound of the number of cycles in a 2-factor of a line graph
Journal of Graph Theory, 2007Jun Fujisawa +2 more
exaly
Zeta functions and complexities of a semiregular bipartite graph and its line graph
Discrete Mathematics, 2007exaly