Searching for authors named "Luerbio Faria" – sorted by Relevance.
-
On the Complexity of (k, l)-Graph Sandwich Problems
- z Luerbio Faria x Abstract A graph G is (k; l) if its vertex set can be partitioned into at most
- Add To MetaCart
-
Optimal Mapping of Neighbourhood-Constrained Systems
- Computa��c~ao Universidade Federal do Rio de Janeiro, Brazil email: felipe@(email omitted); Luerbio Faria
- Cited by 1 (1 self) – Add To MetaCart
-
Optimal Node-Degree Bounds for the Complexity of Nonplanarity Parameters
- Figueiredo y Luerbio Faria z Candido F. X. Mendon��ca x Abstract We prove that both the NP
- Add To MetaCart
-
On the Eggleton and Guy conjectured upper bound for the crossing number of the n-cube
- On the Eggleton and Guy conjectured upper bound for the crossing number of the n--cube Luerbio
- Cited by 4 (1 self) – Add To MetaCart
-
The vertex deletion number and splitting number of a triangulation of Cn × Cm
- Triangulation of C n \Theta Cm Candido F. X. de Mendonca N. ' Erico F. Xavier Jorge Stolfi Luerbio Faria Celina
- Add To MetaCart
-
Optimal Node-Degree Bounds for the Complexity of Nonplanarity Parameters
- Figueiredo y Luerbio Faria z Candido F. X. Mendon��ca x Abstract We prove that both the NP
- Cited by 1 (1 self) – Add To MetaCart
-
The Splitting Number of the 4-Cube
- The splitting number of the 4--cube 1 Luerbio Faria 23 Celina Miraglia Herrera de Figueiredo 34
- Cited by 3 (3 self) – Add To MetaCart
-
On the Complexity of the Approximation of Nonplanarity Parameters for Cubic Graphs
- On the complexity of the approximation of nonplanarity parameters for cubic graphs ? Luerbio Faria
- Cited by 1 (0 self) – Add To MetaCart
-
The Vertex Deletion Number of Cn × Cm
- F. Xavier de Mendonca Erico F. Xavier Luerbio Faria Celina M. H. de Figueiredo Jorge Stolfi Relat
- Add To MetaCart
-
The Splitting Number and Skewness of
- Schaffer 2 ' Erico F. Xavier 3 Jorge Stolfi 3 Luerbio Faria 4 Celina M. H. de Figueiredo 5
- Add To MetaCart

