Some classical combinatorial problems on circulant and claw-free graphs: The isomorphism and coloring problems on circulant graphs and the stable set problem on claw-free graphs (Q1041408)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Some classical combinatorial problems on circulant and claw-free graphs: The isomorphism and coloring problems on circulant graphs and the stable set problem on claw-free graphs |
scientific article; zbMATH DE number 5641541
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Some classical combinatorial problems on circulant and claw-free graphs: The isomorphism and coloring problems on circulant graphs and the stable set problem on claw-free graphs |
scientific article; zbMATH DE number 5641541 |
Statements
Some classical combinatorial problems on circulant and claw-free graphs: The isomorphism and coloring problems on circulant graphs and the stable set problem on claw-free graphs (English)
0 references
2 December 2009
0 references
circulant graph
0 references
claw free graph
0 references
isomorphism
0 references
coloring
0 references
stable set
0 references
0 references
