About: Pairs of heavy subgraphs for hamiltonicity of 2-connected 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
rdfs:seeAlso
Description
  • Let G be a graph on n vertices. An induced subgraph H of G is called heavy if there exist two nonadjacent vertices in H with degree sum at least n in G. We say that G is H-heavy if every induced subgraph of G isomorphic to H is heavy. In this paper we characterize all connected graphs R and S other than P(3) (the path on three vertices) such that every 2-connected {R, S}-heavy graph is Hamiltonian. This extends several previous results on forbidden subgraph conditions for Hamiltonian graphs.
  • Let G be a graph on n vertices. An induced subgraph H of G is called heavy if there exist two nonadjacent vertices in H with degree sum at least n in G. We say that G is H-heavy if every induced subgraph of G isomorphic to H is heavy. In this paper we characterize all connected graphs R and S other than P(3) (the path on three vertices) such that every 2-connected {R, S}-heavy graph is Hamiltonian. This extends several previous results on forbidden subgraph conditions for Hamiltonian graphs. (en)
Title
  • Pairs of heavy subgraphs for hamiltonicity of 2-connected graphs
  • Pairs of heavy subgraphs for hamiltonicity of 2-connected graphs (en)
skos:prefLabel
  • Pairs of heavy subgraphs for hamiltonicity of 2-connected graphs
  • Pairs of heavy subgraphs for hamiltonicity of 2-connected graphs (en)
skos:notation
  • RIV/49777513:23520/12:43915719!RIV13-GA0-23520___
http://linked.open...avai/predkladatel
http://linked.open...avai/riv/aktivita
http://linked.open...avai/riv/aktivity
  • P(1M0545), P(GBP202/12/G061)
http://linked.open...iv/cisloPeriodika
  • 3
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
  • 157607
http://linked.open...ai/riv/idVysledku
  • RIV/49777513:23520/12:43915719
http://linked.open...riv/jazykVysledku
http://linked.open.../riv/klicovaSlova
  • Hamilton cycle; heavy subgraph; forbidden subgraph (en)
http://linked.open.../riv/klicoveSlovo
http://linked.open...odStatuVydavatele
  • US - Spojené státy americké
http://linked.open...ontrolniKodProRIV
  • [8B504087DE05]
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
  • 26
http://linked.open...iv/tvurceVysledku
  • Ryjáček, Zdeněk
  • Li, Binlong
  • Wang, Ying
  • Zhang, Shenggui
issn
  • 0895-4801
number of pages
http://bibframe.org/vocab/doi
  • 10.1137/11084786X
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, 112 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software