About: A note on interconnecting matchings in 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
  • We prove a sufficient condition for a graph G to have a matching that interconnects all the components of a disconnected spanning subgraph of G. We apply the result to the problem of the existence of a (spanning) 2-walk in sufficiently tough graphs.
  • We prove a sufficient condition for a graph G to have a matching that interconnects all the components of a disconnected spanning subgraph of G. We apply the result to the problem of the existence of a (spanning) 2-walk in sufficiently tough graphs. (en)
  • V článku dokazujeme postačující podmínku pro existenci párování, které spojuje všechny komponenty nesouvislého faktoru daného grafu G. Výsledek aplikujeme na problém existence 2-sledu v tuhých grafech. (cs)
Title
  • A note on interconnecting matchings in graphs
  • A note on interconnecting matchings in graphs (en)
  • Poznámka o propojujících párováních (cs)
skos:prefLabel
  • A note on interconnecting matchings in graphs
  • A note on interconnecting matchings in graphs (en)
  • Poznámka o propojujících párováních (cs)
skos:notation
  • RIV/49777513:23520/06:00000515!RIV07-MSM-23520___
http://linked.open.../vavai/riv/strany
  • 2245
http://linked.open...avai/riv/aktivita
http://linked.open...avai/riv/aktivity
  • P(1M0545), Z(MSM4977751301)
http://linked.open...iv/cisloPeriodika
  • 0
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
  • 463704
http://linked.open...ai/riv/idVysledku
  • RIV/49777513:23520/06:00000515
http://linked.open...riv/jazykVysledku
http://linked.open.../riv/klicovaSlova
  • interconnecting matching; toughness; matroid intersection; 2-walk (en)
http://linked.open.../riv/klicoveSlovo
http://linked.open...odStatuVydavatele
  • US - Spojené státy americké
http://linked.open...ontrolniKodProRIV
  • [E3EEBA03ECE1]
http://linked.open...i/riv/nazevZdroje
  • 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...iv/tvurceVysledku
  • Kaiser, Tomáš
http://linked.open...n/vavai/riv/zamer
issn
  • 0012-365X
number of pages
http://localhost/t...ganizacniJednotka
  • 23520
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, 91 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software