Zobrazeno 1 - 8
of 8
pro vyhledávání: '"Bart Litjens"'
Publikováno v:
Electronic Notes in Discrete Mathematics, 68, 227-232. Elsevier
Electronic Notes in Discrete Mathematics, 68, 227-232
Electronic Notes in Discrete Mathematics, 68, 227-232
Let n and k be positive integers with n ≥ 2 k . Consider a circle C with n points 1 , … , n in clockwise order. The interlacing graph IG n , k is the graph with vertices corresponding to k-subsets of [n] that do not contain two adjacent points on
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::c7238bea8e27ae898abc45ecb0c2aa4b
https://doi.org/10.1016/j.endm.2018.06.039
https://doi.org/10.1016/j.endm.2018.06.039
Autor:
Bart Litjens
Publikováno v:
Discrete mathematics, 341(6), 1740-1748. Elsevier
For nonnegative integers $n_2, n_3$ and $d$, let $N(n_2,n_3,d)$ denote the maximum cardinality of a code of length $n_2+n_3$, with $n_2$ binary coordinates and $n_3$ ternary coordinates (in this order) and with minimum distance at least $d$. For a no
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::4db606dab15113eaf2b9a3fd8187a14f
https://hdl.handle.net/11245.1/813febf2-d7ee-4ecf-9fe3-177af527ebbd
https://hdl.handle.net/11245.1/813febf2-d7ee-4ecf-9fe3-177af527ebbd
Publikováno v:
Electronic Notes in Discrete Mathematics, 61, 513-519. Elsevier
We construct a new polynomial invariant of maps (graphs embedded in closed surfaces, not necessarily orientable). Our invariant is tailored to contain as evaluations the number of local flows and local tensions taking non-identity values in any given
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::776aa8aa93536825081503a52b016907
https://doi.org/10.1016/j.endm.2017.07.001
https://doi.org/10.1016/j.endm.2017.07.001
Publikováno v:
Discrete Applied Mathematics, 289, 153-184. Elsevier
We introduce the ``trivariate Tutte polynomial" of a signed graph as an invariant of signed graphs up to vertex switching that contains among its evaluations the number of proper colorings and the number of nowhere-zero flows. In this, it parallels t
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::1e61f93d98e9c733da12c1fdbca6bbbd
http://arxiv.org/abs/1903.07548
http://arxiv.org/abs/1903.07548
Publikováno v:
Designs, Codes, and Cryptography
Designs, Codes and Cryptography, 84, 87-100
Designs, Codes and Cryptography, 84(1-2), 87-100. Springer Netherlands
Designs, Codes and Cryptography, 84, 87-100
Designs, Codes and Cryptography, 84(1-2), 87-100. Springer Netherlands
For nonnegative integers q, n, d, let \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt}
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::528c247773c52e7f1adba4bec872622a
https://doi.org/10.1007/s10623-016-0216-5
https://doi.org/10.1007/s10623-016-0216-5
Publikováno v:
European Journal of Combinatorics, 86:103095. Academic Press Inc.
We construct a new polynomial invariant of maps (graphs embedded in a compact surface, orientable or non-orientable), which contains as specializations the Krushkal polynomial, the Bollob\'as--Riordan polynomial, the Las Vergnas polynomial, and their
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::bd89339df6eca8d836d773a94a2ac941
http://arxiv.org/abs/1804.01496
http://arxiv.org/abs/1804.01496
Publikováno v:
Discrete Applied Mathematics, 259, 232-239
Inspired by a famous characterization of perfect graphs due to Lov\'{a}sz, we define a graph $G$ to be sum-perfect if for every induced subgraph $H$ of $G$, $\alpha(H) + \omega(H) \geq |V(H)|$. (Here $\alpha$ and $\omega$ denote the stability number
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::3c0802e369a4d969de274cf90b20f376
Autor:
Bart Sevenster, Bart Litjens
Publikováno v:
Journal of Graph Theory, 88(2), 271-283. Wiley-Liss Inc.
Let $G$ be a finite group and $\chi: G \rightarrow \mathbb{C}$ a class function. Let $H = (V,E)$ be a directed graph with for each vertex a cyclic order of the edges incident to it. The cyclic orders give a collection $F$ of faces of $H$. Define the
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::75951f6b9a591f9460076f51ab3f73fe