Results 91 to 100 of about 8,970,965 (255)
Clique-to-clique distance computation using a specific architecture [PDF]
, 1998 Joint IAPR International Workshop on Structural, Syntactic and Statistical Pattern Recognition (SSPR&SPR), 1998, Sydney (Australia)In this paper, we present a new fast architecture to compute the distance between cliques in different graphs. The distance
Climent Vilaro, Juan +7 more
core +1 more source
Equivalent Formulation of Thomassen's Conjecture Using Tutte Paths in Claw‐Free Graphs
Journal of Graph Theory, EarlyView.ABSTRACT We continue studying Thomassen's conjecture (every 4‐connected line graph has a Hamilton cycle) in the direction of a recently shown equivalence with Jackson's conjecture (every 2‐connected claw‐free graph has a Tutte cycle), and we extend the equivalent formulation as follows: In every connected claw‐free graph, any two vertices are connected
Adam Kabela +2 more
wiley +1 more source
The Clique Transversal and Clique Independence of Distance Hereditary Graphs
, 2002 A clique-transversal set of a graph G is a subset of vertices intersecting all maximal cliques of G. The smallest possible cardinality τC(G) among all clique transversal sets for G is called clique transversal number.
M. -s. Chang, C. -m. Lee, S. -c. Sheu
core
Clique Partition of Transformation Graphs
, 2016 A clique in a graph G is a complete subgraph of G. A clique partition of G is a collection C of cliques such that each edge of G occurs in exactly one clique in C.
Chandrakala S.B, K.Manjula
core +1 more source
A Note on Lovász Characterization of Perfect Graphs
Journal of Graph Theory, EarlyView.ABSTRACT A graph is perfect if, for every induced subgraph, the chromatic number equals the size of its largest clique. In 1972, Lovász established a fundamental characterization of perfect graphs, showing that a graph is perfect if and only if, for every induced subgraph, the product of the size of the largest independent set and the size of the ...
James Alex
wiley +1 more source
The clique number and some Hamiltonian properties of graphs [PDF]
Contributions to Mathematics, 2021 Rao Li
doaj +1 more source
List-coloring claw-free graphs with small clique number
, 2012 Chudnovsky and Seymour proved that every connected claw-free graph that contains a stable set of size 3 has chromatic number at most twice its clique number.
Louis Esperet +2 more
core
Journal of Graph Theory, EarlyView.ABSTRACT A 2‐edge‐coloured graph G $G$ is called locally complete if for each vertex v $v$, the vertices adjacent to v $v$ through edges of the same colour induce a complete subgraph in G $G$. Locally complete 2‐edge‐coloured graphs have nice properties, and there exists a polynomial algorithm to decide whether such a graph has an alternating ...
Jørgen Bang‐Jensen, Jing Huang
wiley +1 more source
Relative Clique Number of Planar Signed Graphs
, 2016 A signed relative clique number of signed graph (where edges are assigned positive or negative signs) is the size of a largest subset X of vertices such that every two vertices are either adjacent or are part of a 4-cycle with an odd number of negative ...
Sandip Das +7 more
core +1 more source
Journal of Graph Theory, EarlyView.ABSTRACT Lovász et al. proved that every six‐edge‐connected graph has a nowhere‐zero three‐flow. In fact, they proved a more technical statement, which says that there exists a nowhere‐zero three‐flow that extends the flow prescribed on the incident edges of a single vertex z $z$ with bounded degree. We extend this theorem of Lovász et al.
Arnbjörg Soffía Árnadóttir +5 more
wiley +1 more source