Zobrazeno 1 - 10
of 70
pro vyhledávání: '"Fijavž, Gašper"'
Autor:
Fijavz, Gasper, Kriesell, Matthias
Let $G$ be a graph, $r \geq t$ integers, and $N \subseteq E(G)$. An $(r,t)$-threshold-coloring of $G$ with respect to $N$ is a mapping $c: V(G) \rightarrow \{0,\ldots,r-1\}$ such that $|c(u)-c(v)| \leq t$ for every $uv \in N$ and $|c(u)-c(v)|>t$ for
Externí odkaz:
http://arxiv.org/abs/1608.02332
Autor:
Fijavz, Gasper, Kriesell, Matthias
We call a finite undirected graph minimally k-matchable if it has at least k distinct perfect matchings but deleting any edge results in a graph which has not. An odd subdivision of some graph G is any graph obtained by replacing every edge of G by a
Externí odkaz:
http://arxiv.org/abs/1608.01445
Publikováno v:
MATCH Commun. Math. Comput. Chem. 71 (2014) 199-212
A novel self-assembly strategy for polypeptide nanostructure design was presented in [Design of a single-chain polypeptide tetrahedron assembled from coiled-coil segments, Nature Chemical Biology 9 (2013) 362--366]. The first mathematical model (poly
Externí odkaz:
http://arxiv.org/abs/1308.4024
Autor:
Alam, Md. Jawaherul, Chaplick, Steven, Fijavž, Gašper, Kaufmann, Michael, Kobourov, Stephen G., Pupyrev, Sergey
In this paper we study threshold coloring of graphs, where the vertex colors represented by integers are used to describe any spanning subgraph of the given graph as follows. Pairs of vertices with near colors imply the edge between them is present a
Externí odkaz:
http://arxiv.org/abs/1302.6183
Publikováno v:
European J. Combinatorics 32.8:1244-1252, 2011
This paper studies the following question: Given a surface $\Sigma$ and an integer $n$, what is the maximum number of cliques in an $n$-vertex graph embeddable in $\Sigma$? We characterise the extremal graphs for this question, and prove that the ans
Externí odkaz:
http://arxiv.org/abs/0906.4142
Autor:
Fijavž, Gašper, Wood, David R.
Publikováno v:
Electronic J. Combinatorics R151, 2010
Let $\mathcal{D}_k$ be the class of graphs for which every minor has minimum degree at most $k$. Then $\mathcal{D}_k$ is closed under taking minors. By the Robertson-Seymour graph minor theorem, $\mathcal{D}_k$ is characterised by a finite family of
Externí odkaz:
http://arxiv.org/abs/0812.1064
Publikováno v:
Electronic J. Combinatorics 15:R4, 2008
The "minor crossing number" of a graph $G$ is the minimum crossing number of a graph that contains $G$ as a minor. It is proved that for every graph $H$ there is a constant $c$, such that every graph $G$ with no $H$-minor has minor crossing number at
Externí odkaz:
http://arxiv.org/abs/math/0609707
Autor:
Alam, Md. Jawaherul, Chaplick, Steven, Fijavž, Gašper, Kaufmann, Michael, Kobourov, Stephen G., Pupyrev, Sergey, Toeniskoetter, Jackson
Publikováno v:
In Discrete Applied Mathematics 10 January 2017 216 Part 1:2-14
Autor:
Fijavž, Gašper, Nakamoto, Atsuhiro
Publikováno v:
In Discrete Mathematics 6 January 2016 339(1):165-178
Publikováno v:
In European Journal of Combinatorics November 2011 32(8):1244-1252