Results 241 to 250 of about 4,935,854 (284)
Some of the next articles are maybe not open access.
Graphs and Combinatorics, 2013
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Zhaohong Niu, Liming Xiong
openaire +3 more sources
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Zhaohong Niu, Liming Xiong
openaire +3 more sources
Collapsible Graphs and Hamiltonicity of Line Graphs
Graphs and Combinatorics, 2013zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Yang, Weihua +3 more
openaire +4 more sources
Graphs and Combinatorics, 1994
``For integers \(k \geq 2\), the \(k\)-line graph of a graph \(G\) is defined as a graph whose vertices correspond to the complete subgraphs on \(k\) vertices in \(G\) with two distinct vertices adjacent if the corresponding complete subgraphs have \(k-1\) common vertices in \(G\).'' Starting with a graph \(G\), one can construct the sequence of graphs
Van Bang Le, Erich Prisner
openaire +2 more sources
``For integers \(k \geq 2\), the \(k\)-line graph of a graph \(G\) is defined as a graph whose vertices correspond to the complete subgraphs on \(k\) vertices in \(G\) with two distinct vertices adjacent if the corresponding complete subgraphs have \(k-1\) common vertices in \(G\).'' Starting with a graph \(G\), one can construct the sequence of graphs
Van Bang Le, Erich Prisner
openaire +2 more sources
Acta Mathematicae Applicatae Sinica, English Series, 2021
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Yang, Wei-ling +2 more
openaire +1 more source
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Yang, Wei-ling +2 more
openaire +1 more source
Discrete Mathematics, 2022
A connected graph is said to be supereulerian if it containes a spanning Eulerian subgraph. The interest in these graphs comes from the fact that such a graph has a Hamiltonian line graph. A graph \(G\) is called essentially \(k\)-edge connected if \(G\) does not have an essential edge cut \(X\) with \(|X| < k.\) The main results of this paper ...
Yingmin Shangguan, Liming Xiong
openaire +2 more sources
A connected graph is said to be supereulerian if it containes a spanning Eulerian subgraph. The interest in these graphs comes from the fact that such a graph has a Hamiltonian line graph. A graph \(G\) is called essentially \(k\)-edge connected if \(G\) does not have an essential edge cut \(X\) with \(|X| < k.\) The main results of this paper ...
Yingmin Shangguan, Liming Xiong
openaire +2 more sources
Journal of Graph Theory, 1984
AbstractWe give best possible Ore‐like conditions for a graph so that its line graph is Hamiltonian.
openaire +3 more sources
AbstractWe give best possible Ore‐like conditions for a graph so that its line graph is Hamiltonian.
openaire +3 more sources
Communications in Nonlinear Science and Numerical Simulation, 2017
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Wiktor Warchalowski +1 more
openaire +3 more sources
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Wiktor Warchalowski +1 more
openaire +3 more sources
Proceedings of the 48h IEEE Conference on Decision and Control (CDC) held jointly with 2009 28th Chinese Control Conference, 2009
In this paper we investigate discrete linear search and graph search problems. It is well-known that the Bounded Discrete Linear Search Problem (BDLSP) can be solved efficiently using a dynamic programming approach. However, we show that its generalization to the graph case—the Graph Search Problem (GSP)—is NP-complete. We further consider the Discrete
Hua Li, Edwin K. P. Chong
openaire +1 more source
In this paper we investigate discrete linear search and graph search problems. It is well-known that the Bounded Discrete Linear Search Problem (BDLSP) can be solved efficiently using a dynamic programming approach. However, we show that its generalization to the graph case—the Graph Search Problem (GSP)—is NP-complete. We further consider the Discrete
Hua Li, Edwin K. P. Chong
openaire +1 more source
Journal of Graph Theory, 1981
AbstractSufficient conditions on the degrees of a graph are given in order that its line graph have a hamiltonian cycle.
Richard A. Brualdi, Robert F. Shanny
openaire +2 more sources
AbstractSufficient conditions on the degrees of a graph are given in order that its line graph have a hamiltonian cycle.
Richard A. Brualdi, Robert F. Shanny
openaire +2 more sources
On the resistance diameters of graphs and their line graphs
Discrete Applied Mathematics, 2022zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Si-Ao Xu +3 more
openaire +2 more sources