Detail publikace

Graphs with a path partition for structuring the digital plane

ŠLAPAL, J.

Originální název

Graphs with a path partition for structuring the digital plane

Anglický název

Graphs with a path partition for structuring the digital plane

Jazyk

en

Originální abstrakt

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 structures on 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.

Anglický abstrakt

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 structures on 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.

Dokumenty

BibTex


@article{BUT97401,
  author="Josef {Šlapal}",
  title="Graphs with a path partition for structuring the digital plane",
  annote="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 structures on
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.",
  chapter="97401",
  number="1",
  volume="233",
  year="2013",
  month="june",
  pages="305--312",
  type="journal article - other"
}