Results 161 to 170 of about 1,804,356 (287)

Flexible List Coloring of Graphs With Maximum Average Degree Less Than 3

Journal of Graph Theory, EarlyView.
ABSTRACT In the flexible list coloring problem, we consider a graph G $G$ and a color list assignment L $L$ on G $G$, as well as a subset U ⊆ V ( G ) $U\subseteq V(G)$ for which each u ∈ U $u\in U$ has a preferred color p ( u ) ∈ L ( u ) $p(u)\in L(u)$. Our goal is to find a proper L $L$‐coloring ϕ $\phi $ of G $G$ such that ϕ ( u ) = p ( u ) $\phi (u)=
Richard Bi, Peter Bradshaw
wiley   +1 more source

A conjecture of Warnaar-Zudilin from deformations of lie superalgebras. [PDF]

Res Math Sci
Creutzig T, Garner N.
europepmc   +1 more source

A Study on Type-2 Isomorphic Circulant Graphs: Part 8: $C_{432}(R)$, $C_{6750}(S)$ -- each has 2 types of Type-2 isomorphic circulant graphs

In this study, we obtain the following two families of circulant graphs each has Type-2 isomorphic circulant graphs w.r.t. $m$ such that $m$ has more than one value. (i) Family of circulant graphs $C_{432}(R)$, each has isomorphic circulant graphs of Type-2 w.r.t.
openaire   +2 more sources

Sparse Graphs With Local Covering Conditions on Edges

Journal of Graph Theory, EarlyView.
ABSTRACT In 1988, Erdős suggested the question of minimizing the number of edges in a connected n $n$‐vertex graph where every edge is contained in a triangle. Shortly after, Catlin, Grossman, Hobbs, and Lai resolved this in a stronger form. In this paper, we study a natural generalization of the question of Erdős in which we replace “triangle” with ...
Debsoumya Chakraborti, Amirali Madani, Anil Maheshwari, Babak Miraftab   +3 more
wiley   +1 more source

Insights into the functional and genetic basis of heteranthery in Arthrostemma ciliatum Pav. ex D.Don (Melastomataceae). [PDF]

BMC Plant Biol
Kotagal S, Schlick A, Siadjeu C, Hu EY, Kadereit G.   +4 more
europepmc   +1 more source

The Strong Nash‐Williams Orientation Theorem for Rayless Graphs

Journal of Graph Theory, EarlyView.
ABSTRACT In 1960, Nash‐Williams proved his strong orientation theorem that every finite graph has an orientation in which the number of arc‐disjoint directed paths between any two vertices is at least half the number of undirected edge‐disjoint paths between them (rounded down).
Max Pitz, Jacob Stegemann
wiley   +1 more source

New taxa and nomenclatural changes in <i>Bredia</i> (Sonerileae, Melastomataceae). [PDF]

PhytoKeys
Dai JH, Zhong Z, Zhou RC, Liu Y.
europepmc   +1 more source

Line Graphs of Multigraphs and the Forbidden Graph E 6

Journal of Graph Theory, EarlyView.
ABSTRACT The line graph Γ of a multigraph Δ is the graph whose vertices are the edges of Δ, where two such edges are adjacent if and only if they meet in a single vertex of Δ. We provide several characterizations of such line graphs and in particular show that a graph is a line graph if and only if it does not contain one of the 32 graphs, all of which
Hans Cuypers
wiley   +1 more source

Quadratic Subproduct Systems, Free Products, and Their C*-Algebras. [PDF]

Integr Equ Oper Theory
Arici F, Ge Y.
europepmc   +1 more source

On Sparsity Conditions Guaranteeing a Fractional Coloring

Journal of Graph Theory, EarlyView.
ABSTRACT A graph has an ( a : b ) $(a:b)$ ‐coloring if there exists an assignment from the vertices to subsets of { 1 , … , a } $\{1,\ldots ,a\}$ with size b $b$ such that adjacent vertices are assigned disjoint subsets. Odd girth at least 2 k + 1 $2k+1$ is a necessary condition for a graph to have a ( 2 k + 1 : k ) $(2k+1:k)$‐coloring.
Ilkyoo Choi
wiley   +1 more source