About: Disjoint T-paths in tough graphs     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)

AttributesValues
rdf:type
Description
  • Let G be a graph and T a set of vertices. A T-path in G is a path that begins and ends in T, and none of its internal vertices are contained in T. We define a T-path covering to be a union of vertex-disjoint T-paths spanning all of T. Concentrating on graphs that are tough, we completely characterize the edges that are contained in some T-path covering. A corollary of our result is, in a sense, a best possible counterpart of the result of Plesník that every edge of a k-regular (k-1)-edge-connected graph of even order is contained in a 1-factor.
  • Let G be a graph and T a set of vertices. A T-path in G is a path that begins and ends in T, and none of its internal vertices are contained in T. We define a T-path covering to be a union of vertex-disjoint T-paths spanning all of T. Concentrating on graphs that are tough, we completely characterize the edges that are contained in some T-path covering. A corollary of our result is, in a sense, a best possible counterpart of the result of Plesník that every edge of a k-regular (k-1)-edge-connected graph of even order is contained in a 1-factor. (en)
  • Nechť G je graf a T množina vrcholů. T-cesta v G je cesta se začátkem a koncem v T, jejíž vnitřní vrcholy v T neleží. T-cestové pokrytí je sjednocení vrcholově disjunktních T-cest, které pokrývá T. V článku podáváme charakterizaci hran tuhých grafů, které jsou obsaženy v nějakém T-cestovém pokrytí. Důsledkem je (v jistém smyslu) nejlepší možná analogie Plesníkova výsledku, že každá hrana k-regulárního hranově (k-1)-souvislého grafu na sudém počtu vrcholů je obsažena v 1-faktoru. (cs)
Title
  • Disjoint T-paths in tough graphs
  • Disjoint T-paths in tough graphs (en)
  • Disjunktní T-cesty v tuhých grafech (cs)
skos:prefLabel
  • Disjoint T-paths in tough graphs
  • Disjoint T-paths in tough graphs (en)
  • Disjunktní T-cesty v tuhých grafech (cs)
skos:notation
  • RIV/49777513:23520/08:00500725!RIV09-MSM-23520___
http://linked.open...avai/riv/aktivita
http://linked.open...avai/riv/aktivity
  • P(1M0545), Z(MSM4977751301)
http://linked.open...iv/cisloPeriodika
  • 1
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
  • 363785
http://linked.open...ai/riv/idVysledku
  • RIV/49777513:23520/08:00500725
http://linked.open...riv/jazykVysledku
http://linked.open.../riv/klicovaSlova
  • T-path; 1-factor; graft; toughness (en)
http://linked.open.../riv/klicoveSlovo
http://linked.open...odStatuVydavatele
  • US - Spojené státy americké
http://linked.open...ontrolniKodProRIV
  • [ACADC73F8998]
http://linked.open...i/riv/nazevZdroje
  • Journal of Graph Theory
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
  • 59
http://linked.open...iv/tvurceVysledku
  • Kaiser, Tomáš
http://linked.open...ain/vavai/riv/wos
  • 000258554600001
http://linked.open...n/vavai/riv/zamer
issn
  • 0364-9024
number of pages
http://localhost/t...ganizacniJednotka
  • 23520
is http://linked.open...avai/riv/vysledek of
Faceted Search & Find service v1.16.118 as of Jun 21 2024


Alternative Linked Data Documents: ODE     Content Formats:   [cxml] [csv]     RDF   [text] [turtle] [ld+json] [rdf+json] [rdf+xml]     ODATA   [atom+xml] [odata+json]     Microdata   [microdata+json] [html]    About   
This material is Open Knowledge   W3C Semantic Web Technology [RDF Data] Valid XHTML + RDFa
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