Results 151 to 160 of about 8,313 (308)
An Improved Quasi‐Isometry Between Graphs of Bounded Cliquewidth and Graphs of Bounded Treewidth
Journal of Graph Theory, Volume 112, Issue 4, Page 409-420, August 2026.ABSTRACT Cliquewidth is a dense analogue of treewidth. It can be deduced from recent results by Hickingbotham [arXiv:2501.10840] and Nguyen, Scott, and Seymour [arXiv:2501.09839] that graphs of bounded cliquewidth are quasi‐isometric to graphs of bounded treewidth. We improve on this by showing that graphs of cliquewidth k admit a partition with ‘local,
Marc Distel
wiley +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
Matched Filters for Noisy Induced Subgraph Detection. [PDF]
IEEE Trans Pattern Anal Mach Intell, 2020 Sussman DL +3 more
europepmc +1 more source
Long Induced Paths in K s , s‐Free Graphs
Journal of Graph Theory, Volume 112, Issue 4, Page 438-441, August 2026.ABSTRACT More than 40 years ago, Galvin, Rival, and Sands showed that every K s , s‐free graph containing an n‐vertex path must contain an induced path of length f ( n ), where f ( n ) → ∞ as n → ∞. Recently, it was shown by Duron, Esperet, and Raymond that one can take f ( n ) = ( log log n ) 1 / 5 − o ( 1 ).
Zach Hunter +3 more
wiley +1 more source
Absolutely avoidable order-size pairs for induced subgraphs [PDF]
, 2023 Maria Axenovich, Lea Weber
openalex +1 more source
CP models for maximum common subgraph problems
, 2011 . The distance between two graphs is usually defined by means of the size of a largest common subgraph. This common subgraph may be an induced subgraph, obtained by removing nodes, or a partial subgraph, obtained by removing arcs and nodes. In this paper,
Solnon, Christine +3 more
core +1 more source
Some problems on induced subgraphs
Discrete Applied Mathematics, 2018 We discuss some problems related to induced subgraphs. The first problem is about getting a good upper bound for the chromatic number in terms of the clique number for graphs in which every induced cycle has length $3$ or $4$. The second problem is about the perfect chromatic number of a graph, which is the smallest number of perfect sets into which ...
openaire +4 more sources
On Oriented Colourings of Graphs on Surfaces
Journal of Graph Theory, Volume 112, Issue 4, Page 357-369, August 2026.ABSTRACT For an oriented graph G, the least number of colours required to oriented colour G is called the oriented chromatic number of G and denoted χ o ( G ). For a non‐negative integer g let χ o ( g ) be the least integer such that χ o ( G ) ≤ χ o ( g ) for every oriented graph G with Euler genus at most g.
Alexander Clow
wiley +1 more source
On the validity of Lovász’s inequality for induced star-perfect graphs
Journal of Inequalities and ApplicationsLet F $\mathcal{F}$ be a family of graphs. For a graph G, define θ F ( G ) $\theta _{F}(G)$ as the minimum number of induced subgraphs of G, each isomorphic to a member of F $\mathcal{F}$ , needed to cover V ( G ) $V(G)$ , and α F ( G ) $\alpha _{F}(G ...
James Alex, Louis Caccetta
doaj +1 more source
Maximum common induced subgraph parameterized by vertex cover
, 2015 The Maximum Common Induced Subgraph problem (MCIS ) takes a pair of graphs as input and asks for a graph of maximum order that is isomorphic to an induced subgraph of each of the input graphs.
Abu-Khzam, Faisal N.
core +1 more source