Exploration of the T-Interval-Connected Dynamic Graphs: The Case of the Ring

Lecture Notes in Computer Science - Germany
doi 10.1007/978-3-319-03578-9_2
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Springer International Publishing

Related search

Exploration of Constantly Connected Dynamic Graphs Based on Cactuses

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2014English

Dynamic Monopolies for Interval Graphs With Bounded Thresholds

Discrete Applied Mathematics
CombinatoricsApplied MathematicsDiscrete Mathematics
2019English

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

The LBFS Structure and Recognition of Interval Graphs

SIAM Journal on Discrete Mathematics
Mathematics
2010English

Numerical Exploration of the Limit Ring Problem

Qualitative Theory of Dynamical Systems
CombinatoricsApplied MathematicsDiscrete Mathematics
2012English

The Number of Labeled Connected Graphs Modulo Prime Powers

SIAM Journal on Discrete Mathematics
Mathematics
2016English

Patterns on the Connected Components of Terabyte-Scale Graphs

2010English

The Lower Bounds of the Interval Edge-Colorings of Infinite Bicyclic Graphs

Advances in Applied Mathematics
2017English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy