Graphs with a path partition for structuring the digital plane

Result code in IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216305%3A26210%2F13%3APU102124" target="_blank" >RIV/00216305:26210/13:PU102124 - isvavai.cz</a>

Result on the web

—

DOI - Digital Object Identifier

—

Result language

angličtina

Original language name

Graphs with a path partition for structuring the digital plane

Original language description

We introduce the concept of graphs with a path partition and define a special type of connectedness in these graphs. The connectedness is shown to have certain properties suitable for using graphs with a path partition as convenient background structureson digital spaces for the study of digital images. We introduce a family of such graphs on the integer plane and present a Jordan curve theorem for them.

Czech name

—

Czech description

—

Type

J_x - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)

CEP classification

IN - Informatics

OECD FORD branch

—

Project

<a href="/en/project/ED1.1.00%2F02.0070" target="_blank" >ED1.1.00/02.0070: IT4Innovations Centre of Excellence</a><br>

Continuities

P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Publication year

2013

Confidentiality

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Name of the periodical

INFORMATION SCIENCES

ISSN

0020-0255

e-ISSN

—

Volume of the periodical

233

Issue of the periodical within the volume

1

Country of publishing house

US - UNITED STATES

Number of pages

8

Pages from-to

305-312

UT code for WoS article

—

EID of the result in the Scopus database

—