Results 121 to 130 of about 47,591 (350)
, 2017 Multi-clique-width is obtained by a simple modification in the definition of clique-width. It has the advantage of providing a natural extension of tree-width. Unlike clique-width, it does not explode exponentially compared to tree-width.
Fürer, Martin
core +1 more source
Orientations of Graphs With at Most One Directed Path Between Every Pair of Vertices
Journal of Graph Theory, EarlyView.ABSTRACT Given a graph G $G$, we say that an orientation D $D$ of G $G$ is a KT orientation if, for all u , v ∈ V ( D ) $u,v\in V(D)$, there is at most one directed path (in any direction) between u $u$ and v $v$. Graphs that admit such orientations have been used to construct graphs with large chromatic number and small clique number that served as ...
Barbora Dohnalová +3 more
wiley +1 more source
On a Clique‐Building Game of Erdős
Journal of Graph Theory, EarlyView.ABSTRACT The following game was introduced in a list of open problems from 1983 attributed to Erdős: two players take turns claiming edges of a Kn ${K}_{n}$ until all edges are exhausted. Player 1 wins the game if the largest clique that they claim at the end is strictly larger than the largest clique of their opponent; otherwise, Player 2 wins the ...
Alexandru Malekshahian, Sam Spiro
wiley +1 more source
On total directed graphs of non-commutative rings
AKCE International Journal of Graphs and Combinatorics, 2017 For a non-commutative ring , the left total directed graph of is a directed graph with vertex set as and for the vertices and , is adjacent to if and only if there is a non-zero which is different from and , such that is a left zero-divisor of .
Kukil Kalpa Rajkhowa, Helen K. Saikia
doaj +1 more source
Structural Parameterizations of Clique Coloring [PDF]
, 2020 A clique coloring of a graph is an assignment of colors to its vertices such that no maximal clique is monochromatic. We initiate the study of structural parameterizations of the Clique Coloring problem which asks whether a given graph has a clique ...
Lima, Paloma T. +2 more
core +1 more source
On the Hardness of Switching to a Small Number of Edges
Journal of Graph Theory, EarlyView.ABSTRACT Seidel's switching is a graph operation which makes a given vertex adjacent to precisely those vertices to which it was non‐adjacent before, while keeping the rest of the graph unchanged. Two graphs are called switching‐equivalent if one can be made isomorphic to the other one by a sequence of switches. Jelínková et al. [DMTCS 13, no. 2, 2011]
Vít Jelínek +2 more
wiley +1 more source
Weak Degeneracy of Planar Graphs
Journal of Graph Theory, EarlyView.ABSTRACT The weak degeneracy of a graph G $G$ is a numerical parameter that was recently introduced by the first two authors with the aim of understanding the power of greedy algorithms for graph coloring. Every d $d$‐degenerate graph is weakly d $d$‐degenerate, but the converse is not true in general (e.g., all connected d $d$‐regular graphs except ...
Anton Bernshteyn +2 more
wiley +1 more source
Community Detection in Complex Networks via Clique Conductance
Scientific Reports, 2018 Network science plays a central role in understanding and modeling complex systems in many areas including physics, sociology, biology, computer science, economics, politics, and neuroscience.
Zhenqi Lu, Johan Wahlström, A. Nehorai
semanticscholar +1 more source
A Min–Max Relation on Dicuts and Dijoins in Weighted Chordal Digraphs
Journal of Graph Theory, EarlyView.ABSTRACT In a digraph, a dicut is a cut where all the arcs cross in one direction. A dijoin is a subset of arcs that intersects every dicut. Edmonds and Giles conjectured that in a weighted digraph, the minimum weight of a dicut is equal to the maximum size of a packing of dijoins. This has been disproved. However, the unweighted version conjectured by
Gérard Cornuéjols, Siyue Liu, R. Ravi
wiley +1 more source
On the Triangle Clique Cover and $K_t$ Clique Cover Problems
Discret. Math., 2017 14 pages, 1 figure.
Hoang Dau +2 more
openaire +3 more sources