Planar Subgraphs Without Low-Degree Nodes

Lecture Notes in Computer Science - Germany
doi 10.1007/978-3-642-22300-6_49
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Springer Berlin Heidelberg

Related search

On 2-Connected Spanning Subgraphs With Low Maximum Degree

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

On Subgraphs Without Large Components

2016English

Enhancing Speed of Pinning Synchronizability: Low-Degree Nodes With High Feedback Gains

Scientific Reports
Multidisciplinary
2015English

Detecting Communities by Suspecting the Maximum Degree Nodes

International Journal of Modern Physics B
Nonlinear PhysicsCondensed Matter PhysicsStatistical
2019English

Coverage Degree in Mobile Nodes Wireless Sensor Network

2008English

Construction of Planar Triangulations With Minimum Degree 5

Discrete Mathematics
CombinatoricsTheoretical Computer ScienceDiscrete Mathematics
2005English

The Degree/Diameter Problem in Maximal Planar Bipartite Graphs

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

Trust Degree-Based MISO Cooperative Communications With Two Relay Nodes

Wireless Communications and Mobile Computing
Computer NetworksElectronic EngineeringInformation SystemsElectricalCommunications
2019English

Cubature Formulas of Degree Nine for Symmetric Planar Regions

Mathematics of Computation
Computational MathematicsApplied MathematicsNumber TheoryAlgebra
1975English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy