About: Short cycle covers of graphs with minimum degree three

Facets (new session)
Description
Metadata
Settings
- owl:sameAs
- Inference Rule:

About: Short cycle covers of graphs with minimum degree three Goto Sponge NotDistinct Permalink

An Entity of Type : http://linked.opendata.cz/ontology/domain/vavai/Vysledek, within Data Space : linked.opendata.cz associated with source document(s)

Attributes	Values
rdf:type	skos:Concept http://linked.opendata.cz/ontology/domain/vavai/Vysledek
Description	The shortest cycle cover conjecture of Alon and Tarsi asserts that the edges of every bridgeless graph with m edges can be covered by cycles of total length at most 7m/5 = 1.400m. We show that every cubic bridgeless graph has a cycle cover of total length at most 34m/21, which is about 1.619m, and every bridgeless graph with minimum degree three has a cycle cover of total length at most 44m/27, which is about 1.630m. The shortest cycle cover conjecture of Alon and Tarsi asserts that the edges of every bridgeless graph with m edges can be covered by cycles of total length at most 7m/5 = 1.400m. We show that every cubic bridgeless graph has a cycle cover of total length at most 34m/21, which is about 1.619m, and every bridgeless graph with minimum degree three has a cycle cover of total length at most 44m/27, which is about 1.630m. (en)
Title	Short cycle covers of graphs with minimum degree three Short cycle covers of graphs with minimum degree three (en)
skos:prefLabel	Short cycle covers of graphs with minimum degree three Short cycle covers of graphs with minimum degree three (en)
skos:notation	RIV/49777513:23520/10:00503290!RIV11-GA0-23520___
http://linked.open...avai/riv/aktivita	P Z
http://linked.open...avai/riv/aktivity	P(1M0545), P(GA201/09/0197), Z(MSM4977751301)
http://linked.open...iv/cisloPeriodika	1
http://linked.open...vai/riv/dodaniDat	2011
http://linked.open...aciTvurceVysledku	Kaiser, Tomáš
http://linked.open.../riv/druhVysledku	J - Článek v odborném periodiku
http://linked.open...iv/duvernostUdaju	S - Úplné a pravdivé údaje nepodléhající ochraně podle zvláštních právních předpisů
http://linked.open...titaPredkladatele	Západočeská univerzita v Plzni / Fakulta aplikovaných věd
http://linked.open...dnocenehoVysledku	287205
http://linked.open...ai/riv/idVysledku	RIV/49777513:23520/10:00503290
http://linked.open...riv/jazykVysledku	eng - angličtina
http://linked.open.../riv/klicovaSlova	cycle cover; cycle double cover; shortest cycle cover (en)
http://linked.open.../riv/klicoveSlovo	cycle cover cycle double cover shortest cycle cover
http://linked.open...odStatuVydavatele	US - Spojené státy americké
http://linked.open...ontrolniKodProRIV	[094126E2E9F5]
http://linked.open...i/riv/nazevZdroje	SIAM Journal of Discrete Mathematics
http://linked.open...in/vavai/riv/obor	BA
http://linked.open...ichTvurcuVysledku	1 (xsd:int)
http://linked.open...cetTvurcuVysledku	5 (xsd:int)
http://linked.open...vavai/riv/projekt	Institute for Theoretical Computer Science Graph colorings and flows: structure and applications
http://linked.open...UplatneniVysledku	2010
http://linked.open...v/svazekPeriodika	24
http://linked.open...iv/tvurceVysledku	Kaiser, Tomáš Lidický, Bernard Šámal, Robert Král', Daniel Nejedlý, Pavel
http://linked.open...n/vavai/riv/zamer	Spojité a diskrétní matematické struktury a vývoj odpovídajících metod jejich zkoumání
issn	0895-4801
number of pages	26 (xsd:int)
http://localhost/t...ganizacniJednotka	23520

Faceted Search & Find service v1.16.118 as of Jun 21 2024

Alternative Linked Data Documents: ODE Content Formats:

RDF

ODATA

Microdata

About

OpenLink Virtuoso version 07.20.3240 as of Jun 21 2024, on Linux (x86_64-pc-linux-gnu), Single-Server Edition (126 GB total memory, 58 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software