Remarks on the thickness and outerthickness of a graph

Authors:
T. Poranen;E. Mäkinen
Affiliations:
-;-
Venue:
Computers & Mathematics with Applications
Year:
2005

Citing 4
Cited 0

On the thickness of graphs of given degree

Information Sciences: an International Journal
On the thickness and arboricity of a graph

Journal of Combinatorial Theory Series B
A note on Halton's conjecture

Information Sciences—Informatics and Computer Science: An International Journal
A simulated annealing algorithm for determining the thickness of a graph

Information Sciences—Informatics and Computer Science: An International Journal

Quantified Score

Hi-index	0.09

Visualization

Abstract

We establish the Kuhn-Tucker type sufficient optimality conditions for complex minimax programming under generalized Type-I and related functions. Subsequently, we apply these optimality criteria to formulate two dual models. We also establish weak, ...