Results 91 to 100 of about 8,766 (207)

On Approximating the Number of $k$-cliques in Sublinear Time [PDF]

, 2017
Talya Eden, Dana Ron, C. Seshadhri
openalex   +1 more source

The jump of the clique chromatic number of random graphs [PDF]

, 2023
Lyuben Lichev, Dieter Mitsche, Lutz Warnke   +2 more
openalex   +1 more source

Complexity Results on Graphs with Few Cliques

Discrete Mathematics & Theoretical Computer Science, 2007
A graph class has few cliques if there is a polynomial bound on the number of maximal cliques contained in any member of the class. This restriction is equivalent to the requirement that any graph in the class has a polynomial sized intersection ...
Bill Rosgen, Lorna Stewart
doaj  

Integral sum graphs Gn and G-r,n are perfect graphs

AKCE International Journal of Graphs and Combinatorics
A graph G is an integral sum graph (sum graph) if its vertices can be labeled with distinct integers (positive integers) so that e = uv is an edge of G if and only if the sum of the labels on vertices u and v is also a label in G. A graph G is perfect if
Julia K. Abraham, Sajidha P., Lowell W. Beineke, Vilfred V., L. Mary Florida   +4 more
doaj   +1 more source

The Clique-Width of Minimal Series-Parallel Digraphs

Algorithms
MSP DAGs (short for minimal series-parallel digraphs) can be defined from the single vertex graph by applying the parallel composition and series composition.
Frank Gurski, Ruzayn Quaddoura
doaj   +1 more source

The Clique Chromatic Number of Sparse Random Graphs

Random Structures & Algorithms
ABSTRACT The clique chromatic number of a graph is the smallest number of colors in a vertex coloring so that no maximal clique is monochromatic. In this paper, we determine the order of magnitude of the clique chromatic number of the random graph  for most edge‐probabilities  in the range .
Manuel Fernandez, Lutz Warnke
openaire   +2 more sources

Some results on the saturation number for unions of cliques [PDF]

, 2023
Fan Chen, Xiying Yuan
openalex   +1 more source

Anti-Ramsey number of intersecting cliques

An edge-colored graph is called a rainbow graph if all its edges have distinct colors. The anti-Ramsey number $ar(n, G)$, for a graph $G$ and a positive integer $n$, is defined as the minimum number of colors $r$ such that every exact $r$-edge-coloring of the complete graph $K_n$ contains at least one rainbow copy of $G$. A $(k, r)$-fan graph, denoted $
Lu, Hongliang, Luo, Xinyue, Ma, Xinxin
openaire   +2 more sources

Constant Amortized Time Enumeration of Independent Sets for Graphs with Bounded Clique Number

, 2019
Kazuhiro Kurita, K. Wasa, Takeaki Uno, Hiroki Arimura   +3 more
openalex   +1 more source

A note on the clique number of complete $k$-partite graphs [PDF]

, 2015
Boris Brimkov
openalex   +1 more source