Results 31 to 40 of about 3,384,024 (197)
Forbidden induced subgraphs for graphs and signed graphs with eigenvalues bounded from below [PDF]
Forum of Mathematics, Sigma, 2021 The smallest eigenvalue of a graph is the smallest eigenvalue of its adjacency matrix. We show that the family of graphs with smallest eigenvalue at least $-\lambda $ can be defined by a finite set of forbidden induced subgraphs if and only if ...
Zilin Jiang, A. Polyanskii
semanticscholar +1 more source
Forbidden induced subgraphs for perfectness of claw-free graphs of independence number at least 4 [PDF]
Discrete Mathematics, 2021 For every graph X, we consider the class of all connected {K1,3, X}free graphs which are distinct from an odd cycle and have independence number at least 4, and we show that all graphs in the class are perfect if and only if X is an induced subgraph of ...
Christoph Brause +6 more
semanticscholar +1 more source
On minimal forbidden subgraph characterizations of balanced graphs [PDF]
, 2013 Artículo de publicación ISIA graph is balanced if its clique-matrix contains no edge–vertex incidence matrix of an odd chordless cycle as a submatrix.
Safe, Martín D. +9 more
core +2 more sources
Forbidden Induced Subgraphs of Double-split Graphs [PDF]
SIAM Journal on Discrete Mathematics, 2012 16 pages, 2 ...
Boris Alexeev +2 more
openaire +2 more sources
Characterizing path graphs by forbidden induced subgraphs [PDF]
Journal of Graph Theory, 2009 AbstractA path graph is the intersection graph of subpaths of a tree. In 1970, Renz asked for a characterization of path graphs by forbidden induced subgraphs. We answer this question by determining the complete list of graphs that are not path graphs and are minimal with this property. © 2009 Wiley Periodicals, Inc.
Lévêque, Benjamin +2 more
openaire +4 more sources
On Forbidden Induced Subgraphs for Unit Disk Graphs [PDF]
Discrete & Computational Geometry, 2018 A unit disk graph is the intersection graph of disks of equal radii in the plane. The class of unit disk graphs is hereditary, and therefore admits a characterization in terms of minimal forbidden induced subgraphs. In spite of quite active study of unit disk graphs very little is known about minimal forbidden induced subgraphs for this class. We found
Aistis Atminas, Viktor Zamaraev
openaire +4 more sources
On coloring digraphs with forbidden induced subgraphs
Journal of Graph Theory, 2022 AbstractWe prove a conjecture by Aboulker, Charbit, and Naserasr by showing that every oriented graph in which the out‐neighborhood of every vertex induces a transitive tournament can be partitioned into two acyclic induced subdigraphs. We prove multiple extensions of this result to larger classes of digraphs defined by a finite list of forbidden ...
openaire +4 more sources
On forbidden induced subgraphs for K1, 3-free perfect graphs [PDF]
Discrete Mathematics, 2019 Considering connected K 1 , 3 -free graphs with independence number at least 3, Chudnovsky and Seymour (2010) showed that every such graph, say G , is 2 ω -colourable where ω denotes the clique number of G .
Christoph Brause +5 more
semanticscholar +1 more source
The Ryjáček Closure and a Forbidden Subgraph [PDF]
, 2016 The Ryjáček closure is a powerful tool in the study of Hamiltonian properties of claw-free graphs. Because of its usefulness, we may hope to use it in the classes of graphs defined by another forbidden subgraph. In this note, we give a negative answer to
Xiong Liming +3 more
core +1 more source
On Sequential Heuristic Methods for the Maximum Independent Set Problem
Discussiones Mathematicae Graph Theory, 2017 We consider sequential heuristics methods for the Maximum Independent Set (MIS) problem. Three classical algorithms, VO [11], MIN [12], or MAX [6] , are revisited. We combine Algorithm MIN with the α-redundant vertex technique[3].
Lê Ngoc C. +2 more
doaj +1 more source