Parameterized algorithms for recognizing monopolar and 2-subcolorable graphs (Q1678166)
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: Parameterized algorithms for recognizing monopolar and 2-subcolorable graphs |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Parameterized algorithms for recognizing monopolar and 2-subcolorable graphs |
scientific article |
Statements
Parameterized algorithms for recognizing monopolar and 2-subcolorable graphs (English)
0 references
14 November 2017
0 references
vertex-partition problems
0 references
graph classes
0 references
monopolar graphs
0 references
subcolorings
0 references
split graphs
0 references
unipolar graphs
0 references
fixed-parameter algorithms
0 references
0.9407444596290588
0 references
0.8397387862205505
0 references
0.811351478099823
0 references
0.8085845112800598
0 references
0.7925772666931152
0 references
