Results 71 to 80 of about 1,168 (127)
The pathwidth and treewidth of cographs [PDF]
SIAM Journal on Discrete Mathematics, 1990 Summary: It is shown that the pathwidth of a cograph equals its treewidth, and a linear time algorithm to determine the pathwidth of a cograph and build a corresponding path-decomposition is given.
Bodlaender, Hans, Möhring, Rolf H.
openaire +2 more sources
On some combinatorial problems in cographs [PDF]
International Journal of Advances in Engineering Sciences and Applied Mathematics, 2019 21 pages, 4 ...
Harshita Kona, N. Sadagopan
openaire +2 more sources
Limits of Structures and the Example of Tree-Semilattices [PDF]
, 2015 The notion of left convergent sequences of graphs introduced by Lov\' asz et al. (in relation with homomorphism densities for fixed patterns and Szemer\'edi's regularity lemma) got increasingly studied over the past $10$ years.
Charbit, Pierre +2 more
core +4 more sources
On the (non-)existence of polynomial kernels for Pl-free edge modification problems
, 2010 Given a graph G = (V,E) and an integer k, an edge modification problem for a graph property P consists in deciding whether there exists a set of edges F of size at most k such that the graph H = (V,E \vartriangle F) satisfies the property P.
A. Natanzon +16 more
core +2 more sources
Forbidden subgraphs of TI-power graphs of finite groups
Open MathematicsGiven a finite group GG with identity ee, the TI-power graph (trivial intersection power graph) defined on GG, denoted by Γ(G)\Gamma \left(G), is an undirected graph with vertex set GG where distinct vertices aa and bb are adjacent if ⟨a⟩∩⟨b⟩={e}\langle ...
Li Huani, Chen Jin, Lin Shixun
doaj +1 more source
Graph-Based Feature Crossing to Enhance Recommender Systems
MathematicsIn recommendation tasks, most existing models that learn users’ preferences from user–item interactions ignore the relationships between items. Additionally, ensuring that the crossed features capture both global graph structures and local context is non-
Congyu Cai +5 more
doaj +1 more source
On some Graphs with a Unique Perfect Matching
, 2017 We show that deciding whether a given graph $G$ of size $m$ has a unique perfect matching as well as finding that matching, if it exists, can be done in time $O(m)$ if $G$ is either a cograph, or a split graph, or an interval graph, or claw-free ...
Chaplick, S. +3 more
core +1 more source
Integral cographs and applications
, 2019 A graph is called integral if all the eigenvalues of its adjacency matrix are integers. In this paper, we show a cograph that has a balanced cotree $T_{G}(a_{1},\ldots,a_{r-1},0|0,\ldots,0,a_{r})$ is integral computing its spectrum. As an application, these integral cographs can be used to estimate the eigenvalues of any cograph.
Allem, Luiz Emilio, Tura, Fernando
openaire +2 more sources
Graphic splitting of cographic matroids
Discussiones Mathematicae Graph Theory, 2015 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +3 more sources
On the Complexity of Role Colouring Planar Graphs, Trees and Cographs [PDF]
, 2014 We prove several results about the complexity of the role colouring problem. A role colouring of a graph $G$ is an assignment of colours to the vertices of $G$ such that two vertices of the same colour have identical sets of colours in their ...
Purcell, Christopher, Rombach, M. Puck
core