Approximating the Bandwidth for Asteroidal Triple-Free Graphs

ISSN： 0196-6774

Source： Journal of Algorithms, Vol.32, Iss.1, 1999-07, pp. : 41-57

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

Bandwidth sums of block graphs and cacti

By Chang Gerard Chia Ma-Lian Kuo David Lin Ji-Yin Yan Jing-Ho

Journal of Combinatorial Optimization, Vol. 27, Iss. 4, 2014-05 ,pp. : 679-687

Springer Publishing Company

Access to resources Recommend Favorite

Approximating Layout Problems on Random Geometric Graphs

By Díaz J. Penrose M.D. Petit J. Serna M.

Journal of Algorithms, Vol. 39, Iss. 1, 2001-04 ,pp. : 78-116

Academic Press

Access to resources Recommend Favorite

Intrinsically triple linked complete graphs

By Flapan E. Naimi R. Pommersheim J.

Topology and its Applications, Vol. 115, Iss. 2, 2001-09 ,pp. : 239-246

Elsevier

Access to resources Recommend Favorite

Colouring Cubic Graphs by Small Steiner Triple Systems

By Pál Dávid Škoviera Martin

Graphs and Combinatorics, Vol. 23, Iss. 2, 2007-04 ,pp. : 217-228

Springer Publishing Company

Access to resources Recommend Favorite

Reconfigurable UWB antenna with electrically control for triple on‐demand rejection bandwidth

MICROWAVE AND OPTICAL TECHNOLOGY LETTERS, Vol. 57, Iss. 8, 2015-08 ,pp. : 1894-1897

John Wiley & Sons Inc

Access to resources Recommend Favorite