Graph Degeneracy Calculator

k-degenerate core number

All Tools

Loading tool...

About Graph Degeneracy Calculator

A degeneracy calculator computing d(G): smallest k such that G is k-degenerate (every subgraph has vertex of degree ≤k). Equals max k-core number. d = max over subgraphs of min degree. O(n+m) algorithm via iterative minimum degree removal. Client-side.

Graph Degeneracy Calculator Features

  • d(G) value
  • k-core decomp
  • O(n+m) algo
  • Coloring bound
  • Common graphs

More Calculators Tools

Explore all 639 other calculators tools available on Generatr

1-Sample Z-Test Calculator2-Sample Z-Test Calculator3D Surface Area CalculatorA/B Testing Significance CalculatorAbsolute Value CalculatorAbundant Number CheckerAccelerated Aging CalculatorAchromatic Number CalculatorAcyclic Chromatic Number CalculatorAdditive Persistence CalculatorAge CalculatorAging Test CalculatorAlbertson Index CalculatorAlgebraic Connectivity CalculatorAliquot Sequence CalculatorAliquot Sum CalculatorAlternating Series Test CalculatorAmicable Number FinderAnnuity CalculatorAPY CalculatorAquarium CO2 Drop CheckerArea CalculatorArea Under Curve CalculatorArithmetic Sequence CalculatorArmstrong Number CalculatorASCVD Risk CalculatorAspect Ratio CalculatorAtom Bond Connectivity CalculatorAugmented Eccentric Connectivity CalculatorAugmented Zagreb Index Calculator
View all 639 calculators tools
Advertisement
Advertisement