Filters
The hamiltonicity of essentially 9-connected line graphs
Yang et al proved that every 3‐connected, essentially 11‐connected line graph is Hamilton‐connected. This was extended by Li and Yang to 3‐connected, essentially 10‐connected line graphs....
Pure mathematics
- 2021 •
- Jimp •
- Link
Rok uplatnění
Jimp - Článek v periodiku v databázi Web of Science
Výsledek na webu
Hamilton cycles in 5-connected line graphs
A conjecture of Carsten Thomassen states that every 4-connected line graph is hamiltonian. It is known that the conjecture is true for 7-connected line graphs. We improve this by showing that any 5-connected
BA - Obecná matematika
- 2012 •
- Jx •
- Link
Rok uplatnění
Jx - Nezařazeno - Článek v odborném periodiku (Jimp, Jsc a Jost)
Výsledek na webu
Geometric Biplane Graphs II: Graph Augmentation
5-connected biplane graph and that there are arbitrarily large point sets that do not admit any 6-connected biplane graph. Furthermore, we show that every plane graph (other than a wheel or a fan) can be ...
BA - Obecná matematika
- 2015 •
- Jx •
- Link
Rok uplatnění
Jx - Nezařazeno - Článek v odborném periodiku (Jimp, Jsc a Jost)
Výsledek na webu
Line Graphs of Multigraphs and Hamilton-Connectedness of Claw-Free Graphs
We introduce a closure concept that turns a claw-free graph into the line graph of a multigraph while preserving its (non-)Hamiltonconnectedness. As an application, we show that every 7-connected claw-free graph is...
BA - Obecná matematika
- 2011 •
- Jx •
- Link
Rok uplatnění
Jx - Nezařazeno - Článek v odborném periodiku (Jimp, Jsc a Jost)
Výsledek na webu
A Closure for 1-Hamilton-Connectedness in Claw-Free Graphs
that Thomassen's Conjecture (every 4-connected line graph is hamiltonian) is equivalent to the statement that every 4-connected claw-free graph is 1-Hamilton-connected, and we present results showing that...
BA - Obecná matematika
- 2014 •
- Jx •
- Link
Rok uplatnění
Jx - Nezařazeno - Článek v odborném periodiku (Jimp, Jsc a Jost)
Výsledek na webu
On 1-Hamilton-connected claw-free graphs
A graph G is k-Hamilton-connected (k-hamiltonian) if the graph G-X is Hamilton that (i) every 5-connected claw-free graph with minimum degree at least 6 is 1-Hamilton-connected, (ii) every 4-c...
BA - Obecná matematika
- 2014 •
- Jx •
- Link
Rok uplatnění
Jx - Nezařazeno - Článek v odborném periodiku (Jimp, Jsc a Jost)
Výsledek na webu
A Discontinuous Function with a Connected Closed Graph
A Discontinuous Function with a Connected Closed Graph...
BA - Obecná matematika
- 2003 •
- Jx
Rok uplatnění
Jx - Nezařazeno - Článek v odborném periodiku (Jimp, Jsc a Jost)
On signpost systems and connected graphs
Certain ternary relations on connected graphs are studied in this paper.
BA - Obecná matematika
- 2005 •
- Jx
Rok uplatnění
Jx - Nezařazeno - Článek v odborném periodiku (Jimp, Jsc a Jost)
2-edge-Hamiltonian-connectedness of 4-connected plane graphs
A graph G is called 2-edge-Hamiltonian-connect,ed if for every two edges e,f, G that every 4-connected plane graph is 2-edge-Hamiltonian-connected. This result is best-connected plane graphs
BA - Obecná matematika
- 2014 •
- Jx •
- Link
Rok uplatnění
Jx - Nezařazeno - Článek v odborném periodiku (Jimp, Jsc a Jost)
Výsledek na webu
Augmenting the edge connectivity of planar straight line graphs to three
We characterize the 2-connected planar straight line graphs that have embedding preserving augmentations to 3-connected plane graphs....
BA - Obecná matematika
- 2009 •
- D
Rok uplatnění
D - Stať ve sborníku
- 1 - 10 out of 59 653