Zobrazeno 1 - 8
of 8
pro vyhledávání: '"Qu, Zishen"'
Autor:
Qu, Zishen, West, Douglas B.
Given a nonnegative integer weight $f(v)$ for each vertex $v$ in a multigraph $G$, an {\it $f$-bounded subgraph} of $G$ is a multigraph $H$ contained in $G$ such that $d_H(v)\le f(v)$ for all $v\in V(G)$. Using Tutte's $f$-Factor Theorem, we give a n
Externí odkaz:
http://arxiv.org/abs/2307.01324
Publikováno v:
Discrete Mathematics, Volume 347, Issue 1, January 2024, 113691
For a digraph $G$ and $v \in V(G)$, let $\delta^+(v)$ be the number of out-neighbors of $v$ in $G$. The Caccetta-H\"{a}ggkvist conjecture states that for all $k \ge 1$, if $G$ is a digraph with $n = |V(G)|$ such that $\delta^+(v) \ge k$ for all $v \i
Externí odkaz:
http://arxiv.org/abs/2206.10733
Publikováno v:
Discrete Mathematics, Volume 346, Issue 3, March 2023, 113289
Given a graph $G$ and a graph property $P$ we say that $G$ is minimal with respect to $P$ if no proper induced subgraph of $G$ has the property $P$. An HC-obstruction is a minimal 2-connected non-Hamiltonian graph. Given a graph $H$, a graph $G$ is $
Externí odkaz:
http://arxiv.org/abs/2204.07671
Publikováno v:
Discrete Mathematics, Volume 345, Issue 7, July 2022, 112869
In 1981, Duffus, Gould, and Jacobson showed that every connected graph either has a Hamiltonian path, or contains a claw ($K_{1,3}$) or a net (a fixed six-vertex graph) as an induced subgraph. This implies that subject to being connected, these two a
Externí odkaz:
http://arxiv.org/abs/2108.13558
Publikováno v:
In Discrete Mathematics January 2024 347(1)
Publikováno v:
In Discrete Mathematics March 2023 346(3)
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Publikováno v:
In Discrete Mathematics July 2022 345(7)