The following pages link to Fabiano S. Oliveira (Q831862):
Displaying 12 items.
- Thinness of product graphs (Q831864) (← links)
- Linear-time algorithms for eliminating claws in graphs (Q2019430) (← links)
- Precedence thinness in graphs (Q2091785) (← links)
- On subclasses of interval count two and on Fishburn's conjecture (Q2091806) (← links)
- Restricted Hamming–Huffman trees (Q5092535) (← links)
- MaxCut on permutation graphs is NP‐complete (Q6047965) (← links)
- Linear‐time algorithms for eliminating claws in graphs (Q6082274) (← links)
- Maximum cut on interval graphs of interval count four is NP-complete (Q6124829) (← links)
- (Q6168453) (← links)
- Thinness and its variations on some graph families and coloring graphs of bounded thinness (Q6509141) (← links)
- Relation between classes of graphs with interval count \(k\) (Q6543662) (← links)
- Thinness and its variations on some graph families and coloring graphs of bounded thinness (Q6550911) (← links)
