About: 3-choosability of planar graphs with ({= 4)-cycles far apart

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

About: 3-choosability of planar graphs with ({= 4)-cycles far apart 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
rdfs:seeAlso	http://dx.doi.org/10.1016/j.jctb.2013.10.004
Description	A graph is k-choosable if it can be colored whenever every vertex has a list of at least k available colors. We prove that if cycles of length at most four in a planar graph G are pairwise far apart, then G is 3-choosable. This is analogous to the problem of Havel regarding 3-colorability of planar graphs with triangles far apart. A graph is k-choosable if it can be colored whenever every vertex has a list of at least k available colors. We prove that if cycles of length at most four in a planar graph G are pairwise far apart, then G is 3-choosable. This is analogous to the problem of Havel regarding 3-colorability of planar graphs with triangles far apart. (en)
Title	3-choosability of planar graphs with ({= 4)-cycles far apart 3-choosability of planar graphs with ({= 4)-cycles far apart (en)
skos:prefLabel	3-choosability of planar graphs with ({= 4)-cycles far apart 3-choosability of planar graphs with ({= 4)-cycles far apart (en)
skos:notation	RIV/00216208:11320/14:10283290!RIV15-MSM-11320___
http://linked.open...avai/riv/aktivita	P
http://linked.open...avai/riv/aktivity	P(1M0545), P(GA201/09/0197)
http://linked.open...iv/cisloPeriodika	leden
http://linked.open...vai/riv/dodaniDat	2015
http://linked.open...aciTvurceVysledku	Dvořák, Zdeněk
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	Univerzita Karlova v Praze / Matematicko-fyzikální fakulta
http://linked.open...dnocenehoVysledku	58201
http://linked.open...ai/riv/idVysledku	RIV/00216208:11320/14:10283290
http://linked.open...riv/jazykVysledku	eng - angličtina
http://linked.open.../riv/klicovaSlova	List coloring; Planar graphs (en)
http://linked.open.../riv/klicoveSlovo	List coloring Planar graphs
http://linked.open...odStatuVydavatele	US - Spojené státy americké
http://linked.open...ontrolniKodProRIV	[AF3AEC95BA47]
http://linked.open...i/riv/nazevZdroje	Journal of Combinatorial Theory. Series B
http://linked.open...in/vavai/riv/obor	BA
http://linked.open...ichTvurcuVysledku	1 (xsd:int)
http://linked.open...cetTvurcuVysledku	1 (xsd:int)
http://linked.open...vavai/riv/projekt	Institute for Theoretical Computer Science Graph colorings and flows: structure and applications
http://linked.open...UplatneniVysledku	2014
http://linked.open...v/svazekPeriodika	104
http://linked.open...iv/tvurceVysledku	Dvořák, Zdeněk
http://linked.open...ain/vavai/riv/wos	000328235500002
issn	0095-8956
number of pages	32 (xsd:int)
http://bibframe.org/vocab/doi	10.1016/j.jctb.2013.10.004
http://localhost/t...ganizacniJednotka	11320

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