Attributes | Values |
---|
rdf:type
| |
Description
| - A graph G is 1-Hamilton-connected if G?x is Hamilton-connected for every vertex x. We prove that Thomassen's conjecture (every 4-connected line graph is hamiltonian, or, equivalently, every snark has a dominating cycle) is equivalent to the statement that every 4-connected line graph is 1-Hamilton-connected. As a corollary, we obtain that Thomassen's conjecture implies polynomiality of 1-Hamilton-connectedness in line graphs. Consequently, proving that 1-Hamilton-connectedness is NP-complete in line graphs would disprove Thomassen's conjecture, unless P=NP
- A graph G is 1-Hamilton-connected if G?x is Hamilton-connected for every vertex x. We prove that Thomassen's conjecture (every 4-connected line graph is hamiltonian, or, equivalently, every snark has a dominating cycle) is equivalent to the statement that every 4-connected line graph is 1-Hamilton-connected. As a corollary, we obtain that Thomassen's conjecture implies polynomiality of 1-Hamilton-connectedness in line graphs. Consequently, proving that 1-Hamilton-connectedness is NP-complete in line graphs would disprove Thomassen's conjecture, unless P=NP (en)
|
Title
| - Thomassen's Conjecture Implies Polynomiality of 1-Hamilton-Connectedness in Line Graphs
- Thomassen's Conjecture Implies Polynomiality of 1-Hamilton-Connectedness in Line Graphs (en)
|
skos:prefLabel
| - Thomassen's Conjecture Implies Polynomiality of 1-Hamilton-Connectedness in Line Graphs
- Thomassen's Conjecture Implies Polynomiality of 1-Hamilton-Connectedness in Line Graphs (en)
|
skos:notation
| - RIV/49777513:23520/12:43915022!RIV13-MSM-23520___
|
http://linked.open...avai/predkladatel
| |
http://linked.open...avai/riv/aktivita
| |
http://linked.open...avai/riv/aktivity
| - P(1M0545), Z(MSM4977751301)
|
http://linked.open...iv/cisloPeriodika
| |
http://linked.open...vai/riv/dodaniDat
| |
http://linked.open...aciTvurceVysledku
| |
http://linked.open.../riv/druhVysledku
| |
http://linked.open...iv/duvernostUdaju
| |
http://linked.open...titaPredkladatele
| |
http://linked.open...dnocenehoVysledku
| |
http://linked.open...ai/riv/idVysledku
| - RIV/49777513:23520/12:43915022
|
http://linked.open...riv/jazykVysledku
| |
http://linked.open.../riv/klicovaSlova
| - snark; Thomassen's conjecture; dominating cycle; Hamilton-connected; Hamiltonian; 4-connected; line graph (en)
|
http://linked.open.../riv/klicoveSlovo
| |
http://linked.open...odStatuVydavatele
| - US - Spojené státy americké
|
http://linked.open...ontrolniKodProRIV
| |
http://linked.open...i/riv/nazevZdroje
| |
http://linked.open...in/vavai/riv/obor
| |
http://linked.open...ichTvurcuVysledku
| |
http://linked.open...cetTvurcuVysledku
| |
http://linked.open...vavai/riv/projekt
| |
http://linked.open...UplatneniVysledku
| |
http://linked.open...v/svazekPeriodika
| |
http://linked.open...iv/tvurceVysledku
| - Ryjáček, Zdeněk
- Vrána, Petr
- Kužel, Roman
|
http://linked.open...ain/vavai/riv/wos
| |
http://linked.open...n/vavai/riv/zamer
| |
issn
| |
number of pages
| |
http://bibframe.org/vocab/doi
| |
http://localhost/t...ganizacniJednotka
| |
is http://linked.open...avai/riv/vysledek
of | |