Opened 11 years ago

Closed 11 years ago

#7359 closed enhancement (duplicate)

Methods for degenerated graphs

Reported by: ncohen Owned by: rlm
Priority: major Milestone: sage-duplicate/invalid/wontfix
Component: graph theory Keywords:
Cc: Merged in:
Authors: Reviewers:
Report Upstream: N/A Work issues:
Branch: Commit:
Dependencies: Stopgaps:

Status badges


A graph is said to be k-degenerated if it can be totally decomposed by successively removing vertices of degree <= k.

There should be in Sage a function answering if a graph is k-degenerated, and in this case giving the order in which the vertices should be deleted.

Change History (3)

comment:1 Changed 11 years ago by ncohen

  • Report Upstream set to N/A
  • Status changed from new to needs_work

comment:2 Changed 11 years ago by ncohen

This is exactly what the recently-reviewed #9058 does.


comment:3 Changed 11 years ago by mpatel

  • Milestone changed from sage-4.6 to sage-duplicate/invalid/wontfix
  • Resolution set to duplicate
  • Status changed from needs_work to closed
Note: See TracTickets for help on using tickets.