Results 101 to 110 of about 351 (173)
Cover-free families on hypergraphs and combinatorial group testing. [PDF]
Idalino TB, Moura L.
europepmc +1 more source
Note on Polychromatic Coloring of Hereditary Hypergraph Families. [PDF]
Pálvölgyi D.
europepmc +1 more source
The growth rate of multicolor Ramsey numbers of 3-graphs. [PDF]
Bradač D, Fox J, Sudakov B.
europepmc +1 more source
SPECTRUM OF MIXED BI-UNIFORM HYPERGRAPHS
. A mixed hypergraph is a triple H = (V, C,D), where V is a set of vertices, C and D are sets of hyperedges. A vertex-coloring of H is proper if C-edges are not totally multicolored and D-edges are not monochromatic. The feasible set S(H) of H is the set
Enrica Cherubini +2 more
core
Computing degree based topological indices of algebraic hypergraphs. [PDF]
Alali AS +4 more
europepmc +1 more source
On Graphs Embeddable in a Layer of a Hypercube and Their Extremal Numbers. [PDF]
Axenovich M, Martin RR, Winter C.
europepmc +1 more source
Fuzzy incidence coloring under structural operations for communication channel allocation. [PDF]
Deji A, Wang Q, Zhou L.
europepmc +1 more source
Recent Excluded Minor Theorems for Graphs
A graph is a minor of another if the first can be obtained from a subgraph of the second by contracting edges. An excluded minor theorem describes the structure of graphs with no minor isomorphic to a prescribed set of graphs. Splitter theorems are tools
Robin Thomas
core
Design and Analysis of Minimum-Weighted Connected Capacitated Vertex Cover Algorithms for Link Monitoring in IoT-Enabled WSNs. [PDF]
Kol M +3 more
europepmc +1 more source
The Alon-Saks-Seymour and Rank-Coloring Conjectures
This thesis studies the Alon-Saks-Seymour Conjecture and the Rank-Coloring Conjecture and their relationships to computer science. For a graph G, the chromatic number, x(G), is the minimum number of colors needed to properly color the vertices of G. If A(
Tait, Michael
core

