Zobrazeno 1 - 10
of 353
pro vyhledávání: '"Francis, Mathew"'
Autor:
Francis, Mathew, Pattanayak, Drimit
A $p$-centered coloring of a graph $G$, where $p$ is a positive integer, is a coloring of the vertices of $G$ in such a way that every connected subgraph of $G$ either contains a vertex with a unique color or contains more than $p$ different colors.
Externí odkaz:
http://arxiv.org/abs/2207.11496
A graph $G$ on $n$ vertices is a \emph{threshold graph} if there exist real numbers $a_1,a_2, \ldots, a_n$ and $b$ such that the zero-one solutions of the linear inequality $\sum \limits_{i=1}^n a_i x_i \leq b$ are the characteristic vectors of the c
Externí odkaz:
http://arxiv.org/abs/2202.12325
Given a finite family $\mathcal{F}$ of graphs, we say that a graph $G$ is "$\mathcal{F}$-free" if $G$ does not contain any graph in $\mathcal{F}$ as a subgraph. A vertex-colored graph $H$ is called "rainbow" if no two vertices of $H$ have the same co
Externí odkaz:
http://arxiv.org/abs/2111.13115
Hadwiger's conjecture is one of the most important and long-standing conjectures in graph theory. Reed and Seymour showed in 2004 that Hadwiger's conjecture is true for line graphs. We investigate this conjecture on the closely related class of total
Externí odkaz:
http://arxiv.org/abs/2107.09994
Given a digraph $G$, a set $X\subseteq V(G)$ is said to be absorbing set (resp. dominating set) if every vertex in the graph is either in $X$ or is an in-neighbour (resp. out-neighbour) of a vertex in $X$. A set $S\subseteq V(G)$ is said to be an ind
Externí odkaz:
http://arxiv.org/abs/2107.08278
Publikováno v:
In International Journal of Hydrogen Energy 2 January 2024 52 Part C:278-292
Publikováno v:
In International Journal of Hydrogen Energy 2 January 2024 51 Part B:1448-1461
Publikováno v:
In Journal of Physics and Chemistry of Solids January 2024 184
Autor:
Francis, Mathew, Pattanayak, Drimit
Publikováno v:
In Discrete Mathematics January 2024 347(1)
A graph is $k$-clique-extendible if there is an ordering of the vertices such that whenever two $k$-sized overlapping cliques $A$ and $B$ have $k-1$ common vertices, and these common vertices appear between the two vertices $a,b\in (A\setminus B)\cup
Externí odkaz:
http://arxiv.org/abs/2007.06060