Attributes | Values |
---|
rdf:type
| |
rdfs:seeAlso
| |
Description
| - For a subset A of the set of positive integers, a graph G is called A-coverable if G has a cycle (a subgraph in which all vertices have even degree) which intersects all edge-cuts T in G with |T| is in A, and A is said to be coverable if all graphs are A-coverable. As a possible approach to the dominating cycle conjecture, Kaiser and Škrekovski conjectured that N+3 is coverable, where N+3 = {4,5,6,...}. In this paper, we disprove Kaiser and Škrekovski's conjecture by showing that there exist infinitely many graphs which are not {4,5}-coverable. Read More: http://epubs.siam.org/doi/abs/10.1137/120877817
- For a subset A of the set of positive integers, a graph G is called A-coverable if G has a cycle (a subgraph in which all vertices have even degree) which intersects all edge-cuts T in G with |T| is in A, and A is said to be coverable if all graphs are A-coverable. As a possible approach to the dominating cycle conjecture, Kaiser and Škrekovski conjectured that N+3 is coverable, where N+3 = {4,5,6,...}. In this paper, we disprove Kaiser and Škrekovski's conjecture by showing that there exist infinitely many graphs which are not {4,5}-coverable. Read More: http://epubs.siam.org/doi/abs/10.1137/120877817 (en)
|
Title
| - {4,5} Is Not Coverable: A Counterexample to a Conjecture of Kaiser and Škrekovski
- {4,5} Is Not Coverable: A Counterexample to a Conjecture of Kaiser and Škrekovski (en)
|
skos:prefLabel
| - {4,5} Is Not Coverable: A Counterexample to a Conjecture of Kaiser and Škrekovski
- {4,5} Is Not Coverable: A Counterexample to a Conjecture of Kaiser and Škrekovski (en)
|
skos:notation
| - RIV/49777513:23520/13:43919734!RIV14-GA0-23520___
|
http://linked.open...avai/riv/aktivita
| |
http://linked.open...avai/riv/aktivity
| |
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/13:43919734
|
http://linked.open...riv/jazykVysledku
| |
http://linked.open.../riv/klicovaSlova
| - 2-factors; dominating cycle conjecture; coverable; edge-cuts; circuits; cycles (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
| - SIAM JOURNAL ON DISCRETE MATHEMATICS
|
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
| - Vrána, Petr
- Čada, Roman
- Chiba, Shuya
- Ozeki, Kenta
- Yoshimoto, Kiyoshi
|
http://linked.open...ain/vavai/riv/wos
| |
issn
| |
number of pages
| |
http://bibframe.org/vocab/doi
| |
http://localhost/t...ganizacniJednotka
| |