Zobrazeno 1 - 10
of 271
pro vyhledávání: '"Goedgebeur A"'
An $(\{r,m\};g)$-graph is a (simple, undirected) graph of girth $g\geq3$ with vertices of degrees $r$ and $m$ where $2 \leq r < m$ . Given $r,m,g$, we seek the $(\{r,m\};g)$-graphs of minimum order, called $(\{r,m\};g)$-cages or bi-regular cages, who
Externí odkaz:
http://arxiv.org/abs/2411.17351
Autor:
Goedgebeur, Jan, Renders, Jarne
We present an algorithm for the efficient generation of all pairwise non-isomorphic cycle permutation graphs, i.e. cubic graphs with a $2$-factor consisting of two chordless cycles, and non-hamiltonian cycle permutation graphs, from which the permuta
Externí odkaz:
http://arxiv.org/abs/2411.12606
Autor:
Goedgebeur, Jan, Mattiolo, Davide, Mazzuoccolo, Giuseppe, Renders, Jarne, Toffanetti, Luca, Wolf, Isaak H.
A recent result by Kardo\v{s}, M\'a\v{c}ajov\'a and Zerafa [J. Comb. Theory, Ser. B. 160 (2023) 1--14] related to the famous Berge-Fulkerson conjecture implies that given an arbitrary set of odd pairwise edge-disjoint cycles, say $\mathcal O$, in a b
Externí odkaz:
http://arxiv.org/abs/2411.09806
Conduction graphs are defined here in order to elucidate at a glance the often complicated conduction behaviour of molecular graphs as ballistic molecular conductors. The graph $G^{\mathrm C}$ describes all possible conducting devices associated with
Externí odkaz:
http://arxiv.org/abs/2409.13518
For graphs $G$ and $H$, an $H$-coloring of $G$ is an edge-preserving mapping from $V(G)$ to $V(H)$. Note that if $H$ is the triangle, then $H$-colorings are equivalent to $3$-colorings. In this paper we are interested in the case that $H$ is the five
Externí odkaz:
http://arxiv.org/abs/2404.11704
Given two graphs $H_1$ and $H_2$, a graph is $(H_1,H_2)$-free if it contains no induced subgraph isomorphic to $H_1$ nor $H_2$. A graph $G$ is $k$-vertex-critical if every proper induced subgraph of $G$ has chromatic number less than $k$, but $G$ has
Externí odkaz:
http://arxiv.org/abs/2403.05611
Petersen's seminal work in 1891 asserts that the edge-set of a cubic graph can be covered by distinct perfect matchings if and only if it is bridgeless. Actually, it is known that for a very large fraction of bridgeless cubic graphs, every edge belon
Externí odkaz:
http://arxiv.org/abs/2402.08538
Autor:
Goedgebeur, Jan, Jooken, Jorik
Edge-girth-regular graphs (abbreviated as $egr$ graphs) are a class of highly regular graphs. More specifically, for integers $v$, $k$, $g$ and $\lambda$ an $egr(v,k,g,\lambda)$ graph is a $k$-regular graph with girth $g$ on $v$ vertices such that ev
Externí odkaz:
http://arxiv.org/abs/2401.08271
In a given graph, a HIST is a spanning tree without $2$-valent vertices. Motivated by developing a better understanding of HIST-free graphs, i.e. graphs containing no HIST, in this article's first part we study HIST-critical graphs, i.e. HIST-free gr
Externí odkaz:
http://arxiv.org/abs/2401.04554
We present an algorithm which can generate all pairwise non-isomorphic $K_2$-hypohamiltonian graphs, i.e. non-hamiltonian graphs in which the removal of any pair of adjacent vertices yields a hamiltonian graph, of a given order. We introduce new boun
Externí odkaz:
http://arxiv.org/abs/2311.10593