Sciweavers

684 search results - page 9 / 137
» A characterization of b-perfect graphs
Sort
View
ALGORITHMICA
2004
130views more  ALGORITHMICA 2004»
14 years 11 months ago
Diameter and Treewidth in Minor-Closed Graph Families, Revisited
Eppstein [5] characterized the minor-closed graph families for which the treewidth is bounded by a function of the diameter, which includes e.g. planar graphs. This characterizatio...
Erik D. Demaine, Mohammad Taghi Hajiaghayi
GD
2007
Springer
15 years 5 months ago
Characterization of Unlabeled Level Planar Graphs
J. Joseph Fowler, Stephen G. Kobourov
CORR
2008
Springer
69views Education» more  CORR 2008»
14 years 11 months ago
Characterizing path graphs by forbidden induced subgraphs
Benjamin Lévêque, Frédé...
DM
2008
75views more  DM 2008»
14 years 11 months ago
A new characterization of HH-free graphs
Dieter Kratsch, Jeremy Spinrad, R. Sritharan
ENDM
2008
61views more  ENDM 2008»
14 years 11 months ago
Partial Characterizations of Circular-Arc Graphs
Flavia Bonomo, Guillermo Durán, Luciano N. ...