About: Regular clique covers of 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
  • A family of cliques in a graph $G$ is said to be p-regular if any two cliques in the family intersect in exactly $p$ vertices. A graph $G$ is said to have a p-regular k-clique cover if there is a $p$-regular family $\cal H$ of k-cliques of $G$ such tha t each edge $G$ belongs to a clique in $\cal H$. Such a p-regular k-clique cover is separable if the complete subgraphs of order $p$ that arise as intersections of pairs of distinct cliques of $\cal H$ are mutually vertex-disjoint.
  • A family of cliques in a graph $G$ is said to be p-regular if any two cliques in the family intersect in exactly $p$ vertices. A graph $G$ is said to have a p-regular k-clique cover if there is a $p$-regular family $\cal H$ of k-cliques of $G$ such tha t each edge $G$ belongs to a clique in $\cal H$. Such a p-regular k-clique cover is separable if the complete subgraphs of order $p$ that arise as intersections of pairs of distinct cliques of $\cal H$ are mutually vertex-disjoint. (en)
Title
  • Regular clique covers of graphs
  • Regular clique covers of graphs (en)
skos:prefLabel
  • Regular clique covers of graphs
  • Regular clique covers of graphs (en)
skos:notation
  • RIV/49777513:23520/03:00000223!RIV/2004/MSM/235204/N
http://linked.open.../vavai/riv/strany
  • 307-316
http://linked.open...avai/riv/aktivita
http://linked.open...avai/riv/aktivity
  • P(LN00A056), Z(MSM 235200001)
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
  • 625070
http://linked.open...ai/riv/idVysledku
  • RIV/49777513:23520/03:00000223
http://linked.open...riv/jazykVysledku
http://linked.open.../riv/klicovaSlova
  • clique; clique cover (en)
http://linked.open.../riv/klicoveSlovo
http://linked.open...odStatuVydavatele
  • AU - Australské společenství
http://linked.open...ontrolniKodProRIV
  • [1272090230D3]
http://linked.open...i/riv/nazevZdroje
  • Australasian Journal of Combinatorics
http://linked.open...in/vavai/riv/obor
http://linked.open...ichTvurcuVysledku
http://linked.open...cetTvurcuVysledku
http://linked.open...ocetUcastnikuAkce
http://linked.open...nichUcastnikuAkce
http://linked.open...vavai/riv/projekt
http://linked.open...UplatneniVysledku
http://linked.open...v/svazekPeriodika
  • Neuveden
http://linked.open...iv/tvurceVysledku
  • Fronček, Dalibor
  • Ryjáček, Zdeněk
  • Širáň, Jozef
  • Archdeacon, Dan
  • Jajcay, Robert
http://linked.open...n/vavai/riv/zamer
issn
  • 1034-4942
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, 58 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software