Results 121 to 130 of about 6,576,413 (265)
Induced subgraphs of graphs with large chromatic number. I. Odd holes [PDF]
, 2014 Alex Scott, Paul Seymour
openalex +1 more source
哈林图的偶匹配可扩性(Bipartite matching-extendability of Halin graphs)
Zhejiang Daxue xuebao. Lixue ban, 2009 Let G be a connected graph containing a perfect matching. G is said to be bipartite matching extendable if every matching M of G whose induced subgraph is a bipartite matching extends to a perfect matching of G. The main result is as follows: Halin graph
HUIZhi-hao(惠志昊), ZHAOBiao(赵飚)
doaj +1 more source
Enumerating Maximal Induced Subgraphs
, 2020 Given a graph $G$, the maximal induced subgraphs problem asks to enumerate all maximal induced subgraphs of $G$ that belong to a certain hereditary graph class. While its optimization version, known as the minimum vertex deletion problem in literature, has been intensively studied, enumeration algorithms are known for a few simple graph classes, e.g ...
openaire +4 more sources
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
Ramsey Graphs Induce Subgraphs of Quadratically Many Sizes [PDF]
, 2018 Matthew Kwan, Benny Sudakov
openalex +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
Hamilton cycles in almost distance-hereditary graphs
Open Mathematics, 2016 Let G be a graph on n ≥ 3 vertices. A graph G is almost distance-hereditary if each connected induced subgraph H of G has the property dH(x, y) ≤ dG(x, y) + 1 for any pair of vertices x, y ∈ V(H).
Chen Bing, Ning Bo
doaj +1 more source
Absolutely avoidable order-size pairs for induced subgraphs [PDF]
, 2021 Maria Axenovich, Lea Weber
openalex +1 more source
Some Variations of Perfect Graphs
Discussiones Mathematicae Graph Theory, 2016 We consider (ψk−γk−1)-perfect graphs, i.e., graphs G for which ψk(H) = γk−1(H) for any induced subgraph H of G, where ψk and γk−1 are the k-path vertex cover number and the distance (k − 1)-domination number, respectively.
Dettlaff Magda +3 more
doaj +1 more source
Triangle-free induced subgraphs of the unitary polarity graph [PDF]
, 2017 Sam Mattheus, Francesco Pavese
openalex +1 more source