Note: The references are not ordered alphabetically!
| 1300 |
A.M. Dean, N.Veytsel Unit bar-visibility graphs Congr. Numerantium 160 161-175 (2003) |
| 1301 |
X. Zhu Perfect graphs for generalized colouring -- circular perfect graphs Nesetril, J. (ed.) et al., Graphs, morphisms and statistical physics. Proceedings of the workshop held at Rutgers University, Piscataway, NJ, USA, March 19-21, 2001. Providence, RI: American Mathematical Society (AMS). DIMACS. Series in Discrete Mathematics and Theoretical Computer Science 63, 177-193 (2004) |
| 1302 |
J. Bang-Jensen, J. Huang Convex-round graphs are circular-perfect J. Graph Theory 40, No.3, 182-194 (2002) |
| 1303 |
X. Zhu Circular perfect graphs J. Graph Theory 48 186-209 (2005) |
| 1304 |
Eschen, Elaine M.; Hoàng, Chính T.; Petrick, Mark D.T.; Sritharan, R Disjoint clique cutsets in graphs without long holes J. Graph Theory 48, No.4, 277-298 (2005) |
| 1305 |
M.U. Gerber, V.V. Lozin Robust algorithms for the stable set problem Graphs and Combin., to appear |
| 1306 |
M.U. Gerber, A. Hertz, V.V. Lozin Stable sets in two subclasses of banner-free graphs Discrete Appl. Math. 132 121-136 (2004) |
| 1307 |
M.U. Gerber, A. Hertz, D. Schindl P_5-free graphs and the maximum stable set problem Discrete Appl. Math. 132 109-119 (2004) |
| 1308 |
Maw-Shang Chang, Ton Kloks, Dieter Kratsch, Kiping Liu, Sheng-Lung Peng On the recognition of probe graphs of some self-complementary classes of perfect graphs COCOON 2005, Lecture Notes in Computer Science 3595, 808-817 (2005) |
| 1309 |
Van Bang Le, H.N. de Ridder Probe split graphs Accepted for Discrete Mathematics and Theoretical Computer Science, 2005 |
| 1310 |
Chinh T. Hoang, Van Bang Le P_4-free colorings and P_4-bipartite graphs DMTCS 4 109-122 (2001) |
| 1311 |
Andreas Brandstaedt, Van Bang Le Structure and linear time recognition of 3-leaf powers Accepted for Inform. Process. Lett. |
| 1312 |
D. Rautenbach Some remarks about leaf roots Manuscript (2004) |
| 1313 |
Andreas Brandstaedt, Van Bang Le, R. Sritharan Structure and linear time recognition of 4-leaf powers Manuscript (2005) |
| 1314 |
P.E. Kearney, D.G. Corneil Tree powers J. ALgorithms 29 No.1 111-131 (1998) |
| 1315 |
Nikolopoulos, Stavros D.; Palios, Leonidas Recognizing HHD-free and Welsh-Powell opposition graphs Proceedings of WG 2004, Lecture Notes in Computer Science 3353, 105-116 (2004) |
| 1316 |
A. Berry, M.C. Golumbic, M. Lipshteyn Cycle-bicolorable graphs and triangulating chordal probe graphs. Submitted |
| 1317 |
S.D. Nikolopoulos, L. Palios Recognizing HHDS-free graphs Manuscript, 2005 |
| 1318 | Put vertical edges in one forest and horizontal edges in the other. (Communicated by P. Ochem) |
| 1319 | The edges incident to "old" vertices form a star-forest and the remaining edges (incident to two 2-vertices) form a matching. (Communicated by P. Ochem) |
| 1320 |
K. Asano On the genus and thickness of graphs J. Comb. Theory B 43 287-292 (1987) ZMath 0627.05022 |
| 1321 |
H. Czemerinski, G. Duran, A. Gravano Bouchet graphs: A generalization of circle graphs Congr. Numer. 155 95-108 (2002) |
| 1322 |
J-H. Yan, J-J. Chen, G.J. Chang Quasi-threshold graphs Discrete Appl. Math. 69 No.3 247-255 (1996) ZMath 0857.05082 |
| 1323 |
Min Chih Lin, Jayme Luiz Szwarcfiter Efficient construction of unit circular arc models Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2006, 209-315 (2006) |
| 1324 |
G. Duran, A. Gravano, R.M. McConnell, J. Spinrad, A. Tucker Polynomial time recognition of unit circular arc graphs Journal of Algorithms 58, No.1 67-78 (2006) |
| 1325 |
Yu, Chang Wu; Chen, Gen Huey Efficient parallel algorithms for doubly-convex-bipartite graphs Theoret. Comput. Sci. 147 No.1-2 249-265 (1995) |
| 1326 |
S.D. Nikolopoulos, L. Palios Recognizing HH-free, HHD-free and Welsh-Powell opposition graphs Discrete Mathematics and Theoretical Computer Science Vol.8 65-82 (2006) |
| 1327 |
Min Chih Lin, Jayme Luiz Szwarcfiter Characterizations and linear time recognition of Helly circular-arc graphs Proceedings of the twelfth Annual International Conference on Computing and Combinatorics (COCOON'06), Lecture Notes in Computer Science 4112, 73-82 (2006) |
| 1328 |
G.A. Duran Sobre grafos intersección de arcos y cuerdas en un círculo Doctoral dissertation, Universidad de Buenos Aires, 2000. (In Spanish.) Available here. See also the note at [68] . |
| 1329 |
J.A. Gallian A dynamic survey of graph labelling Elec. J. Combin. DS6 Available here |
| 1330 |
A. Rosa On Certain Valuations of the Vertices of a Graph Theory of graph (international symposium, Rome, July 1966) Gordon and Breach N.Y. and Dunod Paris 349-355 (1967) |
| 1331 |
S.W. Golomb How to number a graph In: Graph Theory and Computing, Ed. R.C. Read. Academic Press (1972) 23-37 |
| 1332 |
R.L. Graham, N. Sloane On additive bases and harmonious graphs SIAM J. Algebraic Discrete Math. 1 382-404 (1980) |
| 1333 |
A.A. Krishnaa, M.S. Dulawat, G.S. Rathore Computational complexity in decision problems Conf. of Raj. Parishad, Dec. 14-15 (2001), Udaipur, India |
| 1334 |
R. Shamir, D. Tsur Faster subtree isomorphism Congr. Numer. 140 33-42 (1999) |
| 1335 |
D.B. Chandler, M-S Chang, T. Kloks, J. Liu, S-L Peng Recognition of probe cographs and partitioned probe distance hereditary graphs Proceedings of AAIM 2006, LNCS 4041 267-278 (2006) |
| 1336 |
D.B. Chandler, M-S Chang, T. Kloks, J. Liu, S-L Peng Partitioned probe comparability graphs Proceedings of WG 2006, LNCS 4271 179-190 (2006) |
| 1337 |
D.B. Chandler, M-S Chang, A.J.J. Kloks, J. Liu, S-L Peng On probe permutation graphs Proceedings of TAMC 2006, LNCS 3959 494-504 (2006) |
| 1338 |
A. Bretscher, D.G. Corneil, M. Habib, C. Paul A simple linear time LexBFS cograph recognition algorithm Proceedings of WG2003, LNCS 2880 119-130 (2003) |
| 1339 |
D.E. Brown, J.R. Lundgren, C. Miller Variations on interval graphs Congr. Numerantium 149 77-95 (2001) |
| 1340 |
T. Kloks, C.-S. Liu, S.-L. Peng Domination and independent domination on probe interval graphs Proceedings of 23rd Workshop on Combinatorial Mathematics and Computation Theory 93-97 (2006) Available here |
| 1341 |
Min Chih Lin, Jayme L. Szwarcfiter Faster recognition of clique-Helly and hereditary clique-Helly graphs Information Processing Letters 103 40-43 (2007) |
| 1342 |
H.S. Chao, F.R. Hsu, R.C.T. Lee An Optimal Algorithm for Finding the Minimum Cardinality Dominating Set on Permutation Graphs Discrete Appl. Math. 102, No.3 159-173 (2000) ZMath 1052.90095 |
| 1343 |
Van Bang Le, H.N. de Ridder Characterisations and linear-time recognition of probe cographs Accepted for WG 2007 |
| 1344 |
Daniel Bayer Ueber probe trivially-perfect und probe-Cographen Diplomarbeit, Universitaet Rostock 2006 |
| 1345 |
H.N. de Ridder On probe classes of graphs Ph.D. Thesis, submitted 2007 |
| 1346 |
N.V.R. Mahadev, B.A. Reed A note on vertex orders for stability number J. Graph Theory 30 113-120 (1999) |
| 1347 |
J. Enright, L. Stewart Subtree filament graphs are subtree overlap graphs Information Proc. Letters Vol. 104 Nr.6 228-232 (2007) |
| 1348 | Subtree overlap graphs are string graphs by the following construction: for each subtree, draw a string around the subtree such that if subtree A is contained in subtree B, then string A is closer to the tree model than string B (then string A and string B do not intersect). If subtree A and subtree B are disjoint then their corresponding string do not intersect. If subtree A and subtree B overlap then their corresponding string intersect. (P. Ochem) |
| 1349 |
V.L. Lozin, M. Milanic On finding augmenting graphs Rutcor Research Report 28-2005 http://rutcor.rutgers.edu/pub/rrr/reports2005/38_2005.pdfTo appear in Discrete Appl. Math. |
| 1350 |
V.E. Alekseev On easy and hard hereditary classes of graphs with respect to the independent set problem Discrete Appl. Math. 132, No.1-3 17-26 (2003) |
| 1351 |
V.E. Alekseev, V.V. Lozin Augmenting graphs for independent sets Discrete Appl. Math. 145, No.1 3-10 (2004) |
| 1352 |
R. Mosca Independent sets in certain P_6-free graphs Discrete Applied Math. 92 177-191 (1999) |
| 1353 |
A. Brandstaedt, C.T. Hoang On clique separators, nearly chordal graphs, and the Maximum Weight Stable Set Problem Theoretical Comp. Sci. 389, No.1-2, 295-306 (2007) |