Results 91 to 100 of about 6,506,964 (218)
哈林图的偶匹配可扩性(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
Combination theorems for Wise's power alternative
Journal of the London Mathematical Society, Volume 113, Issue 1, January 2026.Abstract We show that Wise's power alternative is stable under certain group constructions, use this to prove the power alternative for new classes of groups and recover known results from a unified perspective. For groups acting on trees, we introduce a dynamical condition that allows us to deduce the power alternative for the group from the power ...
Mark Hagen +2 more
wiley +1 more source
Induced subgraphs of graphs with large chromatic number. IX. Rainbow\n paths [PDF]
, 2017 Alex Scott, Paul Seymour
openalex +2 more sources
$K_4$-Minor-Free Induced Subgraphs of Sparse Connected Graphs [PDF]
, 2018 Gwenaël Joret, David R. Wood
openalex +1 more source
Quasipolynomiality of the Smallest Missing Induced Subgraph [PDF]
, 2023 David Eppstein +2 more
openalex +1 more source
Induced subgraphs of graphs with large chromatic number. I. Odd holes [PDF]
, 2014 Alex Scott, Paul Seymour
openalex +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
Ramsey Graphs Induce Subgraphs of Quadratically Many Sizes [PDF]
, 2018 Matthew Kwan, Benny Sudakov
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
Induced subgraphs of graphs with large chromatic number. V. Chandeliers and strings [PDF]
, 2021 Maria Chudnovsky +2 more
openalex +1 more source