On the Number of Connected Sets in Bounded Degree Graphs

Lecture Notes in Computer Science - Germany
doi 10.1007/978-3-319-12340-0_28
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Springer International Publishing

Related search

Testing Expansion in Bounded-Degree Graphs

2007English

Sparse Universal Graphs for Bounded-Degree Graphs

Random Structures and Algorithms
MathematicsApplied MathematicsComputer GraphicsComputer-Aided DesignSoftware
2007English

Linear Separation of Connected Dominating Sets in Graphs

Ars Mathematica Contemporanea
AlgebraCombinatoricsNumber TheoryGeometryDiscrete MathematicsTheoretical Computer ScienceTopology
2019English

Doubly Connected Geodetic Number of Graphs

Malaya Journal of Matematik
2018English

Sets That Are Connected in Two Random Graphs

Random Structures and Algorithms
MathematicsApplied MathematicsComputer GraphicsComputer-Aided DesignSoftware
2013English

Degree-Associated Reconstruction Number of Graphs

Discrete Mathematics
CombinatoricsTheoretical Computer ScienceDiscrete Mathematics
2010English

Testing Hereditary Properties of Nonexpanding Bounded-Degree Graphs

SIAM Journal on Computing
MathematicsComputer Science
2009English

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

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy