activity
20132023
most citedNonempty Intersection of Longest Paths in Series-Parallel Graphs

33 citations · 34 across the 6 of their papers we have counts for

collaborators

6 papers

math.AP2023

Existence of solutions for a poly-Laplacian system involving concave-convex nonlinearity on locally finite graphs

Ping Yang, Xingyong Zhang

We investigate the existence of two nontrivial solutions for a poly-Laplacian system involving concave-convex nonlinearities and parameters with Dirichlet boundary condition on loc…

math.AP2023

Existence and multiplicity of nontrivial solutions for a -Laplacian system on locally finite graphs

Ping Yang, Xingyong Zhang

We generalize two embedding theorems and investigate the existence and multiplicity of nontrivial solutions for a -Laplacian coupled system with perturbations and two parame…

math.OC2019★ 1 cited

Generalizing Laplacian Controllability of Paths

Shun-Pin Hsu, Ping-Yen Yang

It is well known that if a network topology is a path or line and the states of vertices or nodes evolve according to the consensus policy, then the network is Laplacian controllab…

math.CO2015

Difference of forbidden pairs containing a claw

Guantao Chen, Michitaka Furuya, Songling Shan +2

When we study forbidden subgraph conditions guaranteeing graphs to have some properties, a claw (or ) frequently appears as one of forbidden subgraphs. Recently, Furuya an…

math.CO2014

Minimum degree condition for spanning generalized Halin graphs

Guantao Chen, Songling Shan, Ping Yang

A spanning tree with no vertices of degree 2 is called a Homeomorphically irreducible spanning tree\,(HIST). Based on a HIST embedded in the plane, a Halin graph is formed by conne…

math.CO2013★ 33 cited

Nonempty Intersection of Longest Paths in Series-Parallel Graphs

Julia Ehrenmüller, Cristina G. Fernandes, Carl Georg Heise

In 1966 Gallai asked whether all longest paths in a connected graph have nonempty intersection. This is not true in general and various counterexamples have been found. However, th…