Contractible Subgraphs in 3-Connected Graphs

Journal of Combinatorial Theory. Series B - United States
doi 10.1006/jctb.2000.1960
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Elsevier BV

Related search

Toughness, Forbidden Subgraphs, and Hamilton-Connected Graphs

Discussiones Mathematicae - Graph Theory
CombinatoricsApplied MathematicsDiscrete Mathematics
2019English

Faster Algorithms for Computing Maximal 2-Connected Subgraphs in Sparse Directed Graphs

2017English

On Dominating Even Subgraphs in Cubic Graphs

SIAM Journal on Discrete Mathematics
Mathematics
2017English

Colorful Subgraphs in Kneser-Like Graphs

European Journal of Combinatorics
CombinatoricsMathematicsGeometryDiscrete MathematicsComputational TheoryTheoretical Computer ScienceTopology
2007English

On 3-Total Edge Product Cordial Connected Graphs

Opuscula Mathematica
Mathematics
2017English

Random Subgraphs in Cartesian Powers of Regular Graphs

Electronic Journal of Combinatorics
CombinatoricsApplied MathematicsMathematicsGeometryDiscrete MathematicsComputational TheoryTopologyTheoretical Computer Science
2012English

The Number of Polyhedral (3-Connected Planar) Graphs

Mathematics of Computation
Computational MathematicsApplied MathematicsNumber TheoryAlgebra
1996English

The Number of Polyhedral (3-Connected Planar) Graphs

Mathematics of Computation
Computational MathematicsApplied MathematicsNumber TheoryAlgebra
1981English

On Unavoidable-Induced Subgraphs in Large Prime Graphs

Journal of Graph Theory
GeometryTopology
2017English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy