Results 221 to 230 of about 39,621 (255)
Epidemiological Characteristics of Pain Among Rowers: A Retrospective Questionnaire Study. [PDF]
J Pain ResMa H +8 more
europepmc +1 more source
Routing Functions for Parameter Space Decomposition to Describe Stability Landscapes of Ecological Models. [PDF]
Bull Math BiolCummings J +3 more
europepmc +1 more source
Bevacizumab Plus EGFR-TKIs vs EGFR-TKIs Alone for Advanced EGFR-Mutant NSCLC: A Meta-Analysis. [PDF]
Clin Med Insights OncolWang Z +5 more
europepmc +1 more source
Some of the next articles are maybe not open access.
Journal of Graph Theory, 2005
AbstractBollobás and Thomason showed that every 22k‐connected graph is k‐linked. Their result used a dense graph minor. In this paper, we investigate the ties between small graph minors and linkages. In particular, we show that a 6‐connected graph with a K minor is 3‐linked.
Florian Pfender, Bing Wei
exaly +3 more sources
AbstractBollobás and Thomason showed that every 22k‐connected graph is k‐linked. Their result used a dense graph minor. In this paper, we investigate the ties between small graph minors and linkages. In particular, we show that a 6‐connected graph with a K minor is 3‐linked.
Florian Pfender, Bing Wei
exaly +3 more sources
Graph minors. XXI. Graphs with unique linkages
Journal of Combinatorial Theory Series B, 2009 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Paul Seymour
exaly +2 more sources
Random Structures & Algorithms, 2005
AbstractWe study here lifts and random lifts of graphs, as defined by Amit and Linial (Combinatorica 22 (2002), 1–18). We consider the Hadwiger number η and the Hajós number σ of ℓ‐lifts of Kn and analyze their extremal as well as their typical values (that is, for random lifts). When ℓ = 2, we show that ${n \over 2} \leq \eta \leq n$, and random lifts
Yotam Drier, Nathan Linial
openaire +2 more sources
AbstractWe study here lifts and random lifts of graphs, as defined by Amit and Linial (Combinatorica 22 (2002), 1–18). We consider the Hadwiger number η and the Hajós number σ of ℓ‐lifts of Kn and analyze their extremal as well as their typical values (that is, for random lifts). When ℓ = 2, we show that ${n \over 2} \leq \eta \leq n$, and random lifts
Yotam Drier, Nathan Linial
openaire +2 more sources
On the extremal function for graph minors [PDF]
Journal of Graph Theory, 2022 AbstractFor a graph , let , where means that is a minor of . We show that if has average degree , then where is an explicitly defined constant. This bound matches a corresponding lower bound shown to hold for almost all such by Norin, Reed, Wood and the first author.
Andrew Thomason
exaly +4 more sources
Excluding Minors in Cubic Graphs
Combinatorics, Probability and Computing, 1996Let P10\e be the graph obtained by deleting an edge from the Petersen graph. We give a decomposition theorem for cubic graphs with no minor isomorphic to P10\e. The decomposition is used to show that graphs in this class are 3-edge-colourable. We also consider an application to a conjecture due to Grötzsch which states that a planar graph is 3-edge ...
Kyriakos Kilakos, F. Bruce Shepherd
openaire +2 more sources
A Note on Oct1+-Minor-Free Graphs and Oct2+-Minor-Free Graphs
Journal of Interconnection Networks, 2022Let [Formula: see text] and [Formula: see text] be the planar and non-planar graphs, respectively, obtained from the Octahedron by 3-splitting a vertex. For [Formula: see text], we prove that if a 4-connected graph is [Formula: see text]-minor-free, then it is [Formula: see text], [Formula: see text] [Formula: see text] or it is obtained from [Formula:
Wenyan Jia +3 more
openaire +1 more source