About: The complexity of coloring graphs without long induced paths.

Facets (new session)
Description
Metadata
Settings
- owl:sameAs
- Inference Rule:

About: The complexity of coloring graphs without long induced paths. 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)

Attributes	Values
rdf:type	skos:Concept http://linked.opendata.cz/ontology/domain/vavai/Vysledek
Description	We discuss the computational complexity of determining the chromatic number of graphs without long induced paths. We discuss the computational complexity of determining the chromatic number of graphs without long induced paths. (en)
Title	The complexity of coloring graphs without long induced paths. The complexity of coloring graphs without long induced paths. (en)
skos:prefLabel	The complexity of coloring graphs without long induced paths. The complexity of coloring graphs without long induced paths. (en)
skos:notation	RIV/67985840:_____/01:05025164!RIV/2003/AV0/A05003/N
http://linked.open.../vavai/riv/strany	107;117
http://linked.open...avai/riv/aktivita	P Z
http://linked.open...avai/riv/aktivity	P(GA201/01/1195), P(GA201/99/0242), P(IAA1019901), P(LN00A056), Z(AV0Z1019905), Z(MSM 113200005)
http://linked.open...iv/cisloPeriodika	1
http://linked.open...vai/riv/dodaniDat	2003
http://linked.open...aciTvurceVysledku	Sgall, Jiří
http://linked.open.../riv/druhVysledku	J - Článek v odborném periodiku
http://linked.open...iv/duvernostUdaju	S - Úplné a pravdivé údaje nepodléhající ochraně podle zvláštních právních předpisů
http://linked.open...titaPredkladatele	Matematický ústav AV ČR, v. v. i.
http://linked.open...dnocenehoVysledku	676084
http://linked.open...ai/riv/idVysledku	RIV/67985840:_____/01:05025164
http://linked.open...riv/jazykVysledku	eng - angličtina
http://linked.open.../riv/klicovaSlova	graph coloring%chromatic number%computational complexity (en)
http://linked.open.../riv/klicoveSlovo	graph coloring%chromatic number%computational complexity
http://linked.open...odStatuVydavatele	HU - Maďarsko
http://linked.open...ontrolniKodProRIV	[326DC93066A6]
http://linked.open...i/riv/nazevZdroje	Acta Cybernetica
http://linked.open...in/vavai/riv/obor	BA
http://linked.open...ichTvurcuVysledku	1 (xsd:int)
http://linked.open...cetTvurcuVysledku	2 (xsd:int)
http://linked.open...ocetUcastnikuAkce	0 (xsd:int)
http://linked.open...nichUcastnikuAkce	0 (xsd:int)
http://linked.open...vavai/riv/projekt	Institute of Theoretical Computer Science (Center of Young Science) Combinatorial algorithms and combinatorial problems in complexity theory DIMATIA - center of discrete mathematics, theoretical computer science and applications Mathematical logic and computational complexity
http://linked.open...UplatneniVysledku	2001
http://linked.open...v/svazekPeriodika	15
http://linked.open...iv/tvurceVysledku	Sgall, Jiří Woeginger, G. J.
http://linked.open...n/vavai/riv/zamer	Complex development of all branches of mathematics with regard to the needs of physics and technology http://linked.opendata.cz/resource/domain/vavai/zamer/MSM%20113200005
issn	0324-721X
number of pages	11 (xsd:int)

Faceted Search & Find service v1.16.118 as of Jun 21 2024

Alternative Linked Data Documents: ODE Content Formats:

RDF

ODATA

Microdata

About

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, 48 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software