Results 101 to 110 of about 351 (173)

SPECTRUM OF MIXED BI-UNIFORM HYPERGRAPHS

open access: yes, 2015
. 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]

open access: yesHeliyon
Alali AS   +4 more
europepmc   +1 more source

Recent Excluded Minor Theorems for Graphs

open access: yes, 1999
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  

The Alon-Saks-Seymour and Rank-Coloring Conjectures

open access: yes, 2011
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  

Home - About - Disclaimer - Privacy