Results 21 to 30 of about 655,680 (212)

Independent sets of maximum weight in apple-free graphs [PDF]

open access: yes, 2010
We present the first polynomial-time algorithm to solve the maximum weight independent set problem for apple-free graphs, which is a common generalization of several important classes where the problem can be solved efficiently, such as claw-free graphs,
Lozin, Vadim V.   +2 more
core   +1 more source

Slimness of graphs [PDF]

open access: yesDiscrete Mathematics & Theoretical Computer Science, 2019
Slimness of a graph measures the local deviation of its metric from a tree metric. In a graph $G=(V,E)$, a geodesic triangle $\bigtriangleup(x,y,z)$ with $x, y, z\in V$ is the union $P(x,y) \cup P(x,z) \cup P(y,z)$ of three shortest paths connecting ...
Feodor F. Dragan, Abdulhakeem Mohammed
doaj   +1 more source

Capturing Logarithmic Space and Polynomial Time on Chordal Claw-Free Graphs [PDF]

open access: yesLogical Methods in Computer Science, 2019
We show that the class of chordal claw-free graphs admits LREC$_=$-definable canonization. LREC$_=$ is a logic that extends first-order logic with counting by an operator that allows it to formalize a limited form of recursion.
Berit Grußien
doaj   +1 more source

Graph Extremities Defined by Search Algorithms

open access: yesAlgorithms, 2010
Graph search algorithms have exploited graph extremities, such as the leaves of a tree and the simplicial vertices of a chordal graph. Recently, several well-known graph search algorithms have been collectively expressed as two generic algorithms called ...
Jean-Paul Bordat   +3 more
doaj   +1 more source

Algorithmic Aspects of Secure Connected Domination in Graphs

open access: yesDiscussiones Mathematicae Graph Theory, 2021
Let G = (V, E) be a simple, undirected and connected graph. A connected dominating set S ⊆ V is a secure connected dominating set of G, if for each u ∈ V \ S, there exists v ∈ S such that (u, v) ∈ E and the set (S \ {v}) ∪ {u} is a connected dominating ...
Kumar Jakkepalli Pavan   +1 more
doaj   +1 more source

Characterizing 2-Trees Relative to Chordal and Series-Parallel Graphs

open access: yesTheory and Applications of Graphs, 2021
The 2-connected 2-tree graphs are defined as being constructible from a single 3-cycle by recursively appending new degree-2 vertices so as to form 3-cycles that have unique edges in common with the existing graph.
Terry McKee
doaj   +1 more source

Recognition of chordal graphs and cographs which are Cover-Incomparability graphs [PDF]

open access: yesDiscrete Mathematics & Theoretical Computer Science
Cover-Incomparability graphs (C-I graphs) are an interesting class of graphs from posets. A C-I graph is a graph from a poset $P=(V,\le)$ with vertex set $V$, and the edge-set is the union of edge sets of the cover graph and the incomparability graph of ...
Arun Anil, Manoj Changat
doaj   +1 more source

自余弱弦图(On self-complementary weakly chordal graphs)

open access: yesZhejiang Daxue xuebao. Lixue ban, 2010
The class of self-complementary (sc) weakly chordal graphs is studied, which is a generalization of self-complementary chordal graphs, lower and upper bounds for the number of two-pairs in sc weakly chordal graphs have been obtained.
MERAJUDDIN()   +3 more
doaj   +1 more source

Graphs of low chordality [PDF]

open access: yesDiscrete Mathematics & Theoretical Computer Science, 2005
The chordality of a graph with at least one cycle is the length of the longest induced cycle in it. The odd (even) chordality is defined to be the length of the longest induced odd (even) cycle in it. Chordal graphs have chordality at most 3. We show that co-circular-arc graphs and co-circle graphs have even chordality at most 4.
Chandran, Sunil   +2 more
openaire   +6 more sources

Heroes in Orientations of Chordal Graphs

open access: yesSIAM Journal on Discrete Mathematics, 2022
We characterize all digraphs $H$ such that orientations of chordal graphs with no induced copy of $H$ have bounded dichromatic number.
Aboulker, Pierre   +2 more
openaire   +5 more sources

Home - About - Disclaimer - Privacy