Results 161 to 170 of about 5,251,465 (203)
Prognostic Value of Platelet-Associated Biomarkers in Nasopharyngeal Carcinoma Patients Received IMRT: A Retrospective Study. [PDF]
Int J Gen MedJiang Y, Ma J, Huang S, Pan X, Zhu X.
europepmc +1 more source
Maximum Out-of-Pocket Limits in Dual-Eligible Special Needs Plans.
JAMA Health ForumIanni KM.
europepmc +1 more source
Correction for Brown et al., Deuterated water and the formation of the satellites of Uranus. [PDF]
Proc Natl Acad Sci U S Aeuropepmc +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches:
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
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
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
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