On the Probe Problem for (r,ℓ)-Well-Coveredness

von Faria, Luerbio
Veröffentlicht in COCOON (27. : 2021 : Tainan) Computing and Combinatorics (2021)

Graph Sandwich Problem for the Property of Being Well-Covered and Partitionable into k Independent Sets and ℓ Cliques

von Alves, Sancrey Rodrigues
Veröffentlicht in LATIN (14. : 2020 : Online) LATIN 2020: theoretical informatics (2020)

On the Oriented Coloring of the Disjoint Union of Graphs

von Coelho, Erika Morais Martins
Veröffentlicht in IWOCA (32. : 2021 : Online) Combinatorial Algorithms (2021)

LATIN 2008: theoretical informatics : 8th Latin American symposium, Búzios, Brazil, April 7-11, 2008 ; proceedings

Veröffentlicht 2008