On 2-Connected Spanning Subgraphs With Low Maximum Degree

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

Available in full text

Date
Authors
Publisher

Elsevier BV

Related search

Approximating Bounded-Degree Spanning Trees and Connected Factors With Leaves

Operations Research Letters
IndustrialApplied MathematicsManufacturing EngineeringManagement ScienceOperations ResearchSoftware
2017English

Planar Subgraphs Without Low-Degree Nodes

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2011English

On Decompositions of a Multi-Graph Into Spanning Subgraphs

Bulletin of the American Mathematical Society
1974English

Computing Square Roots of Graphs With Low Maximum Degree

Discrete Applied Mathematics
CombinatoricsApplied MathematicsDiscrete Mathematics
2018English

On the Number of Connected Convex Subgraphs of a Connected Acyclic Digraph

Discrete Applied Mathematics
CombinatoricsApplied MathematicsDiscrete Mathematics
2009English

Contractible Subgraphs in 3-Connected Graphs

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

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

2017English

Toughness, Forbidden Subgraphs, and Hamilton-Connected Graphs

Discussiones Mathematicae - Graph Theory
CombinatoricsApplied MathematicsDiscrete Mathematics
2019English

2-Approximation Algorithm for Finding a Spanning Tree With Maximum Number of Leaves

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
1998English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy