Toughness, Forbidden Subgraphs, and Hamilton-Connected Graphs

Discussiones Mathematicae - Graph Theory - Poland
doi 10.7151/dmgt.2247
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Faculty of Mathematics, Computer Science and Econometrics, University of Zielona Gora

Related search

Contractible Subgraphs in 3-Connected Graphs

Journal of Combinatorial Theory. Series B
CombinatoricsComputational TheoryDiscrete MathematicsTheoretical Computer ScienceMathematics
2000English

Ramsey-Type Theorems With Forbidden Subgraphs

Combinatorica
CombinatoricsComputational MathematicsDiscrete Mathematics
2001English

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

2017English

On the Caccetta-Häggkvist Conjecture With Forbidden Subgraphs

Journal of Graph Theory
GeometryTopology
2012English

A Characterization of Graph Properties Testable for General Planar Graphs With One-Sided Error (It's All About Forbidden Subgraphs)

2019English

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

Random Subgraphs of Cayley Graphs Overp-Groups

European Journal of Combinatorics
CombinatoricsMathematicsGeometryDiscrete MathematicsComputational TheoryTheoretical Computer ScienceTopology
2000English

Generating Connected and 2-Edge Connected Graphs

Journal of Graph Algorithms and Applications
GeometryComputer Science ApplicationsComputer ScienceMathematicsComputational TheoryTheoretical Computer ScienceTopology
2009English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy