Zobrazeno 1 - 10
of 49
pro vyhledávání: '"Jan Bok"'
Autor:
Nikola Jedličková, Jan Bok
Publikováno v:
Commentationes Mathematicae Universitatis Carolinae. 62:135-149
We study \emph{edge-sum distinguishing labeling}, a type of labeling recently introduced by Tuza in [Zs. Tuza, \textit{Electronic Notes in Discrete Mathematics} 60, (2017), 61-68] in context of labeling games. An \emph{ESD labeling} of an $n$-vertex
Publikováno v:
Bulletin of the Malaysian Mathematical Sciences Society. 44:3733-3745
The Wiener index is one of the most widely studied parameters in chemical graph theory. It is defined as the sum of the lengths of the shortest paths between all unordered pairs of vertices in a given graph. In 1991, Soltes posed the following proble
Publikováno v:
Arts, Vol 8, Iss 3, p 77 (2019)
This study presents a data driven comparative analysis of the painting industries in sixteenth and seventeenth century Antwerp and Amsterdam. The popular view of the development of these two artistic centers still holds that Antwerp flourished in the
Externí odkaz:
https://doaj.org/article/21865011ec2e41bfbc7bb92a08e7a8f1
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783031066771
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::f26f5f1d3b214562a7970f80107678b1
https://doi.org/10.1007/978-3-031-06678-8_17
https://doi.org/10.1007/978-3-031-06678-8_17
Publikováno v:
Algorithms and Discrete Applied Mathematics ISBN: 9783030950170
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::e0e1fa9e64453369ed520d920be44efd
https://doi.org/10.1007/978-3-030-95018-7_3
https://doi.org/10.1007/978-3-030-95018-7_3
Publikováno v:
LATIN 2022: Theoretical Informatics ISBN: 9783031206238
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::f827ba9f4e60aa63bc55bdf0df52be65
https://doi.org/10.1007/978-3-031-20624-5_31
https://doi.org/10.1007/978-3-031-20624-5_31
Publikováno v:
Computer Science – Theory and Applications ISBN: 9783030794156
CSR
CSR
A function \(c:V(G)\rightarrow \{1,2,\ldots ,k\}\) is a k-colouring of a graph G if \(c(u)\ne c(v)\) whenever u and v are adjacent. If any two colour classes induce the disjoint union of vertices and edges, then c is called injective. Injective colou
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::43483670e1fe9f56c441026f5f9441c8
https://doi.org/10.1007/978-3-030-79416-3_2
https://doi.org/10.1007/978-3-030-79416-3_2
Autor:
Jan Bok
Publikováno v:
Personal Response Systems: An International Report of a New Home Care Service ISBN: 9781315825380
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::69afab4f531cf292dbd873f865495369
https://doi.org/10.1201/9781315825380-15
https://doi.org/10.1201/9781315825380-15
We consider homomorphisms of signed graphs from a computational perspective. In particular, we study the list homomorphism problem seeking a homomorphism of an input signed graph $(G,\sigma)$, equipped with lists $L(v) \subseteq V(H), v \in V(G)$, of
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::17f3aadd69ae21a1da983fa7bd3857d9
Autor:
Jan Bok, Jana Maxová
Publikováno v:
Order. 36:349-358
In this paper we continue investigations of cover-incomparability graphs of finite partially ordered sets (see \cite{Bres,Bres2,Bres3,Bres4} and \cite{Max,MaxDH}). We consider in some detail the distinction between cover-preserving subsets and isomet