About: Which k-trees are cover-incomparability 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
  • In this paper we dea lwith cover?incomparability graphs o fposets.It is known that the class of cover?incomparability graphs is not closed on induced subgraphs which makes the study of structural properties of these graphs difficult. In this paper we introduce the notion of s-subgraph which enables us to define forbidden s-subgraphs (i.e. graphs that cannot appear as s-subgraphs of any cover?incomparability graph). We show that the family of minimal forbidden s-subgraphs is infinite even for cover?incomparability unit-interval graphs.Using the notion of s-subgraph we also answer the question which k-trees are cover?incomparability graphs and which chordal graphs without K4 are cover?incomparabilitygraphs.
  • In this paper we dea lwith cover?incomparability graphs o fposets.It is known that the class of cover?incomparability graphs is not closed on induced subgraphs which makes the study of structural properties of these graphs difficult. In this paper we introduce the notion of s-subgraph which enables us to define forbidden s-subgraphs (i.e. graphs that cannot appear as s-subgraphs of any cover?incomparability graph). We show that the family of minimal forbidden s-subgraphs is infinite even for cover?incomparability unit-interval graphs.Using the notion of s-subgraph we also answer the question which k-trees are cover?incomparability graphs and which chordal graphs without K4 are cover?incomparabilitygraphs. (en)
Title
  • Which k-trees are cover-incomparability graphs?
  • Which k-trees are cover-incomparability graphs? (en)
skos:prefLabel
  • Which k-trees are cover-incomparability graphs?
  • Which k-trees are cover-incomparability graphs? (en)
skos:notation
  • RIV/60461373:22340/14:43895350!RIV15-MSM-22340___
http://linked.open...avai/riv/aktivita
http://linked.open...avai/riv/aktivity
  • V
http://linked.open...iv/cisloPeriodika
  • 20. April 2014
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
  • 56162
http://linked.open...ai/riv/idVysledku
  • RIV/60461373:22340/14:43895350
http://linked.open...riv/jazykVysledku
http://linked.open.../riv/klicovaSlova
  • Poset, Cover-incomparability graph, Chordal graph, Simplicial vertex, k-tree (en)
http://linked.open.../riv/klicoveSlovo
http://linked.open...odStatuVydavatele
  • NL - Nizozemsko
http://linked.open...ontrolniKodProRIV
  • [B2B7DFB3F604]
http://linked.open...i/riv/nazevZdroje
  • DISCRETE APPLIED MATHEMATICS
http://linked.open...in/vavai/riv/obor
http://linked.open...ichTvurcuVysledku
http://linked.open...cetTvurcuVysledku
http://linked.open...UplatneniVysledku
http://linked.open...v/svazekPeriodika
  • Vol.167
http://linked.open...iv/tvurceVysledku
  • Pavlíková, Pavla
  • Dubcová, Miroslava
  • Maxová, Jana
  • Turzík, Daniel
http://linked.open...ain/vavai/riv/wos
  • 000333492800022
issn
  • 0166-218X
number of pages
http://bibframe.org/vocab/doi
  • 10.1016/j.dam.2013.11.019
http://localhost/t...ganizacniJednotka
  • 22340
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