Zobrazeno 1 - 10
of 38
pro vyhledávání: '"MSC-05C35"'
Autor:
Xiong, Liming, Broersma, H.J.
Publikováno v:
Discrete applied mathematics, 154(9), 1453-1463. Elsevier
A graph is called subpancyclic if it contains a cycle of length $\ell$ for each $\ell$ between 3 and the circumference of the graph. We show that if $G$ is a connected graph on $n\ge 146$ vertices such that $d(u)+d(v)+d(x)+d(y)>(n+10/2)$ for all four
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::571396bbbd291a7d1998cc088b304cc0
Publikováno v:
Graphs and combinatorics, 28(1), 57-75. Springer
We survey results and open problems in hamiltonian graph theory centered around two conjectures of the 1980s that are still open: every 4-connected claw-free graph (line graph) is hamiltonian. These conjectures have lead to a wealth of interesting co
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::335119b393d70ea381e091f17854ee49
https://research.utwente.nl/en/publications/82c4edb3-0df3-463d-9242-09c8315c0a07
https://research.utwente.nl/en/publications/82c4edb3-0df3-463d-9242-09c8315c0a07
Publikováno v:
Discrete applied mathematics, 155(1/2), 92-102. Elsevier
Discrete Applied Mathematics, 155(2), 92-102. Elsevier
Discrete Applied Mathematics, 155(2), 92-102. Elsevier
In 1997 Lampert and Slater introduced parallel knock-out schemes, an iterative process on graphs that goes through several rounds. In each round of this process, every vertex eliminates exactly one of its neighbors. The parallel knock-out number of a
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::ecbda1cfa18dbdf8d3ad8db399c1150e
https://research.utwente.nl/en/publications/104921b0-be2d-42af-ad7e-116e24c02327
https://research.utwente.nl/en/publications/104921b0-be2d-42af-ad7e-116e24c02327
Autor:
Bonsma, P.S.
We present two lower bounds for the maximum number of leaves in a spanning tree of a graph. For connected graphs without triangles, with minimum degree at least three, we show that a spanning tree with at least (n+4)/3 leaves exists, where n is the n
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=narcis______::f8d0547d9a28bb94a1229f531c2b4a8f
https://research.utwente.nl/en/publications/spanning-trees-with-many-leaves-new-extremal-results-and-an-improved-fpt-algorithm(52a33dc4-a6e4-4b67-af65-29a969cba8c2).html
https://research.utwente.nl/en/publications/spanning-trees-with-many-leaves-new-extremal-results-and-an-improved-fpt-algorithm(52a33dc4-a6e4-4b67-af65-29a969cba8c2).html
We present two lower bounds for the maximum number of leaves in a spanning tree of a graph. For connected graphs without triangles, with minimum degree at least three, we show that a spanning tree with at least (n+4)/3 leaves exists, where n is the n
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=dris___00893::0250eace2a21d1667323450da84177bd
A graph is called (matching-)immune if it has no edge cut that is also a matching. Farley and Proskurowski proved that for all immune graphs $G=(V,E)$, $|E|\geq \lceil 3(|V|-1)/2\rceil$, and constructed a large class of immune graphs attaining this l
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=dris___00893::b15b431c796ecc192934f114565cd957
Autor:
Bonsma, P.S.
A graph is called (matching-)immune if it has no edge cut that is also a matching. Farley and Proskurowski proved that for all immune graphs $G=(V,E)$, $|E|\geq \lceil 3(|V|-1)/2\rceil$, and constructed a large class of immune graphs attaining this l
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=narcis______::cd18bcf9e7df674896b09a68f849d1d1
https://research.utwente.nl/en/publications/a-characterization-of-extremal-graphs-without-matchingcuts(7c55cc1b-5fde-427e-9f42-e63b65bec338).html
https://research.utwente.nl/en/publications/a-characterization-of-extremal-graphs-without-matchingcuts(7c55cc1b-5fde-427e-9f42-e63b65bec338).html
The hamiltonian index of a graph $G$ is the smallest integer $k$ such that the $k$-th iterated line graph of $G$ is hamiltonian. We first show that, with one exceptional case, adding an edge to a graph cannot increase its hamiltonian index. We use th
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=dris___00893::54dd9a6ff338dc8d226ed7d4101cc562
We consider toughness conditions that guarantee the existence of a hamiltonian cycle in $k$-trees, a subclass of the class of chordal graphs. By a result of Chen et al.\ 18-tough chordal graphs are hamiltonian, and by a result of Bauer et al.\ there
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=dris___00893::766b426401e321dfa106780bb8aba591
Publikováno v:
University of Twente Research Information (Pure Portal)
A graph is called {\sl subpancyclic} if it contains a cycle of length $l$ for each $l$ between 3 and the circumference of a graph. We show that if $G$ is a connected graph on $n\geq 146$ vertices such that $d(u)+d(v)+d(x)+d(y)>\frac{n+10}{2}$ for all
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::6b8e1c7150938a834074888c6ea57c2b
https://research.utwente.nl/en/publications/a143b1a9-c71a-44dc-959c-dbdde4efbf9d
https://research.utwente.nl/en/publications/a143b1a9-c71a-44dc-959c-dbdde4efbf9d