ISGCI project home  All classes  Smallgraphs

Graphclass: unigraph

Definition:
A graph is a unigraph if it is determined by its degree sequence up to isomorphism.

References: [289] [662] [685] [725] [1052] [1053] [1054] [1055]

Inclusions

Maximal subclasses:  XC9-free   matrogenic 

Problems summary

Recognition:Lineardetails
Cliquewidth expression: Unknown to ISGCI details
Cliquewidth: Unknown to ISGCI details
Weighted independent set: Unknown to ISGCI details
Independent set: Unknown to ISGCI details
Domination: Unknown to ISGCI details

Algorithms for Recognition

Linear [1055]

Algorithms for Cliquewidth expression

See also : Cliquewidth : Weighted independent set : Domination

Algorithms for Cliquewidth

See also : Cliquewidth expression

Algorithms for Weighted independent set

See also : Cliquewidth expression : Independent set

Algorithms for Independent set

See also : Weighted independent set

Algorithms for Domination

See also : Cliquewidth expression