PC-Trees and Planar Graphs

More documents

Recommendations

Info

2 [5] W. L. Hsu and R. McConnell, “PC-trees and circular-ones arrangement”, Theoretical Computer Science 296(1), 99–116, (2003). [6] Wen-Lian Hsu and Ross McConnell,“PQ Trees, PC Trees and Planar Graphs”, a book chapter in Handbook of Data Structures and Applications, edited by Dinesh P. Mehta and Sartaj Sahni, (2004). [7] W. L. Hsu, “A new test for interval graphs”, Lecture Notes in Computer Science 657, 11–16, (1992). [8] R. Thomas, “Planarity in linear time” - Lecture Notes, Georgia Institute of Technology, http://www.math.gatech.edu/∼thomas/, (1997).
Ramsey Functions Involviong Large Complete Graphs AUTHOR: Yusheng Li 李雨生 Department of Mathematics, Tongji University li yusheng@tongji.edu.cn ABSTRACT Let F and H be graphs. The Ramsey number r(F, H) is defined as the minimum integer N such that any graph G of order N, either G contains F or ¯ G contains H. We write r(m, n) = r(Km, Kn), which is called the classical Ramsey number. From the definition, r(F, Kn) is the minimum integer N such that any graph G of order N, either G contains F or α(G) ≥ n, where α(G) is the independence number of G. This talk is a survey on estimating the Ramsey function r(F, Kn) for a fixed graph F and large n. To find good bounds for such function, many new ideas, techniques and methods have developed. Among these, probabilistic method, semi-random methods, random process, and algebraic method are often used. 3
Page 1: PC-Trees and Planar Graphs AUTHOR:
Page 5 and 6: Planarity for Partially Ordered Set
Page 7 and 8: The Strong Chromatic Index of Cubic
Page 9 and 10: Some topics on acyclic edge colorin
Page 11 and 12: The Linear k-Arboricity of Balanced
Page 13 and 14: Catalan Numbers Modulo a Prime Powe
Page 15 and 16: Some properties of graphs on matroi
Page 17 and 18: MIS, MDS and MCDS Problems on Graph
Page 19 and 20: F3-domination number of graphs AUTH
Page 21 and 22: Clique-transversal sets and 2-cliqu
Page 23 and 24: Hypergraphs and k-power domination
Page 25 and 26: The cubic vertices of minimal brick
Page 27 and 28: Some Results on Cyclic Polytopes an
Page 29 and 30: Acyclic List Edge Coloring of Graph
Page 31 and 32: Splittable Graphs AUTHOR: Chiang Li
Page 33 and 34: D-bounded Property in a Distance-re
Page 35 and 36: The mutually independent hamiltonia
Page 37 and 38: Weight distribution of Preparata co
Page 39 and 40: The Decycling Number of Outerplanar
Page 41 and 42: Existence of optimal (v, {3, 4}, 1,
Page 43 and 44: A New Point of View on (k, m, n)-Se
Page 45 and 46: On n-fold L(j, k)- and circular L(j
Page 47 and 48: Path covering number and L(2, 1)-la
Page 49 and 50: The circular L(j, k)-labeling numbe
Page 51 and 52: Existence of normal bimagic squares
Page 53 and 54:
Identification and Classification P
Page 55 and 56:
Hamiltonian properties in Cartesian
Page 57 and 58:
Heavy Subgraphs Conditions for Hami
Page 59 and 60:
On the Dynamic Colorings of Graphs
Page 61 and 62:
WSNB Under New Compound Routing Str
Page 63 and 64:
Maps with highest level of symmetry
Page 65 and 66:
The extremal energies of weighted t
Page 67 and 68:
On the Estrada Index AUTHOR: Bo Zho
Page 69 and 70:
On the spectral radius of graphs an
Page 71 and 72:
Hedetniemi’s conjecture is true o
Page 73 and 74:
Some recent progress on combinatori
Page 75 and 76:
Partitioned difference families and
Page 77 and 78:
Algebraic and Combinatorial Constru
Page 79 and 80:
Quaternary sequence with optimal au
Page 81 and 82:
Multi-sweep maximal neighborhood se
Page 83 and 84:
Edge-transitive dihedral or cyclic
Page 85 and 86:
On Simsun and Double Simsun Permuta
Page 87 and 88:
On normal Bases and their multiplic
Page 89 and 90:
Operations of graphs and unimodalit
Page 91 and 92:
q-series and U(n + 1) extension AUT
show all

PC-Trees and Planar Graphs

Create successful ePaper yourself

Delete template?

Save as template?