Results 171 to 180 of about 8,313 (308)
MAXIMUM r-REGULAR INDUCED SUBGRAPH PROBLEM: FAST EXPONENTIAL ALGORITHMS AND COMBINATORIAL BOUNDS
, 2012 We show that for a fixed r, the number of maximal r-regular induced subgraphs in any graph with n vertices is upper bounded by O(c(n)), where c is a positive constant strictly less than 2.
Saurabh, S. +5 more
core +1 more source
Sensitivity and Hamming Graphs
Journal of Graph Theory, Volume 112, Issue 3, Page 296-305, July 2026.ABSTRACT For any m ≥ 3 we show that the Hamming graph H ( n , m ) admits an imbalanced partition into m sets, each inducing a subgraph of low maximum degree. This improves previous results by Tandya and by Potechin and Tsang, and disproves the Strong m‐ary Sensitivity Conjecture of Asensio, García‐Marco, and Knauer.
Sara Asensio +3 more
wiley +1 more source
Induced subgraphs and tree decompositions I. Even-hole-free graphs of bounded degree [PDF]
, 2020 Tara Abrishami +2 more
openalex +1 more source
Reoptimization of maximum weight induced hereditary subgraph problems
, 2011 The reoptimization issue studied in this paper can be described as follows: given an instance I of some problem Π, an optimal solution OPT for Π in I and an instance I′ resulting from a local perturbation of I that consists of insertions or removals of a
Monnot, Jérôme +2 more
core
Path Eccentricity and Forbidden Induced Subgraphs
CoRRAbstract.
Cichacz, Sylwia +4 more
openaire +3 more sources
Treewidth Versus Clique Number. V. Further Connections With Tree‐Independence Number
Journal of Graph Theory, Volume 112, Issue 3, Page 337-351, July 2026.ABSTRACT We continue the study of ( tw , ω )‐bounded graph classes, that is, hereditary graph classes in which large treewidth is witnessed by the presence of a large clique, and the relation of this property to boundedness of the tree‐independence number, a graph parameter introduced independently by Yolov in 2018 and by Dallard, Milanič, and Štorgel ...
Claire Hilaire +2 more
wiley +1 more source
Triangle-free induced subgraphs of the unitary polarity graph [PDF]
, 2017 Sam Mattheus, Francesco Pavese
openalex +1 more source
Unavoidable Induced Subgraph of Infinite 2-connected Graphs [PDF]
, 2022 Sarah Allred +2 more
openalex +1 more source
Every tree contains a large induced subgraph with all degrees odd
, 1995 Caro et al. [3] proved that every tree of order n contains an induced subgraph of order at least ⌈n2⌉ with all degrees odd, and conjectured a better bound. In this note we prove that every tree of order n contains an induced subgraph of order at least 2⌊(
Scott, A.D. +3 more
core +1 more source
Ordered Median Traveling Salesman Problem
Networks, Volume 88, Issue 1, Page 59-84, July 2026.ABSTRACT This paper introduces a novel combinatorial optimization problem with ordering constraints, termed the Ordered Median Traveling Salesman Problem (OMTSP). The OMTSP integrates key elements from both the classic Traveling Salesman Problem (TSP) and the Ordered Median Location Problem.
Ivana Ljubić +3 more
wiley +1 more source