About: On Switching to H-Free 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
  • In this paper we study the problem of deciding if, for a fixed graph H, a given graph is switching-equivalent to an H-free graph. We show that for H isomorphic to a claw, the problem is polynomial. Further, we give a characterization of graphs switching-equivalent to a $K_{1,2}$-free graph by ten forbidden induced subgraphs, each having five vertices. We also give the forbidden induced subgraphs for graphs switching-equivalent to a forest of bounded vertex degrees.
  • In this paper we study the problem of deciding if, for a fixed graph H, a given graph is switching-equivalent to an H-free graph. We show that for H isomorphic to a claw, the problem is polynomial. Further, we give a characterization of graphs switching-equivalent to a $K_{1,2}$-free graph by ten forbidden induced subgraphs, each having five vertices. We also give the forbidden induced subgraphs for graphs switching-equivalent to a forest of bounded vertex degrees. (en)
Title
  • On Switching to H-Free Graphs
  • On Switching to H-Free Graphs (en)
skos:prefLabel
  • On Switching to H-Free Graphs
  • On Switching to H-Free Graphs (en)
skos:notation
  • RIV/00216208:11320/08:00206158!RIV10-MSM-11320___
http://linked.open...avai/riv/aktivita
http://linked.open...avai/riv/aktivity
  • P(1M0545), Z(MSM0021620838)
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
  • 384686
http://linked.open...ai/riv/idVysledku
  • RIV/00216208:11320/08:00206158
http://linked.open...riv/jazykVysledku
http://linked.open.../riv/klicovaSlova
  • Switching; H-Free; Graphs (en)
http://linked.open.../riv/klicoveSlovo
http://linked.open...ontrolniKodProRIV
  • [13E537BE911D]
http://linked.open...v/mistoKonaniAkce
  • Heidelberg
http://linked.open...i/riv/mistoVydani
  • Heidelberg
http://linked.open...i/riv/nazevZdroje
  • Graph Transformations, ICGT 2008
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
  • Jelínková, Eva
  • Kratochvíl, Jan
http://linked.open...vavai/riv/typAkce
http://linked.open...ain/vavai/riv/wos
  • 000261330400026
http://linked.open.../riv/zahajeniAkce
http://linked.open...n/vavai/riv/zamer
number of pages
http://purl.org/ne...btex#hasPublisher
  • Springer-Verlag
https://schema.org/isbn
  • 978-3-540-87404-1
http://localhost/t...ganizacniJednotka
  • 11320
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, 39 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software