Note: The references are not ordered alphabetically!
500 |
J. Hagauer, W. Imrich, S. Klav\v{z}ar Recognizing median graphs in subquadratic time \TCS, to appear 0 ZMath 0913.68152 |
501 |
A. Hajnal, J. Sur\'anyi \"Uber die Aufl\"osung von Graphen in vollst\"andige Teilgraphen {\sl Ann. Univ. Sci. Budapest, E\"otv\"os Sect. Math. 1} 1958 113--121 |
502 |
G. Haj\'os \"Uber eine Art von Graphen {\sl Intern. Math. Nachr.} 11 Problem 65 1957 |
503 |
R. Halin \"Uber simpliziale Zerf\"allungen beliebiger (endlicher oder unendlicher Graphen Math. Ann. 156, 216-225 (1964). [ISSN 0025-5831] ZMath 0125.11605 |
504 |
R. Halin Studies on minimally $n$--connected graphs in: {\sc D.J.A. Welsh}, ed., {\sl Combinatorial mathematics and itsapplications},Academic Press, New York 1971 129--136 ZMath 0218.05076 |
505 |
R. Halin Graphentheorie Akademie--Verlag, Berlin 1989 |
506 |
R. Halin Some remarks on interval graphs Combinatorica 2 1982 297--304 ZMath 0513.05051 |
507 |
R. Halin Simplicial decompositions and triangulated graphs {\sl Graph Theory and Combinatorics},{\sc B. Bollob\'as}, ed., Academic Press, London 1984 ZMath 0549.05052 |
508 |
R.C. Hamelink A partial characterization of clique graphs J. Comb. Theory 5 1968 192--197 ZMath 0167.22203 |
509 |
P.L. Hammer, T. Ibaraki, B. Simeone Degree sequences of threshold graphs % Proceedings 9th South--Eastern Conf. on Combinatorics, Graph Theory and Computing 1978 \CongNum ( ZMath 0417.05054 |
510 |
P.L. Hammer, A.K. Kelmans On universal threshold graphs {\sl Combinatorics, Probability and Computing} 3 1994 327--344 ZMath 0879.05038 |
511 |
P.L. Hammer, F. Maffray Completely separable graphs Discrete Appl. Math. 27 1990 85--99 ZMath 0694.05060The linear time recognition algorithm of distance hereditary graphs in this article contains an error that was corrected in
[1491]
.
G. Damiand, M. Habib, Ch. Paul
A simple paradigm for graph recognition: application to cographs and distance-hereditary graphs Theo. Comp. Sci. 263 99-111 (2001) |
512 |
P.L. Hammer, F. Maffray Preperfect graphs Combinatorica 13 1993 199--208 ZMath 0780.05024 |
513 |
P.L. Hammer, F. Maffray, M. Preissmann A characterization of chordal bipartite graphs RUTCOR Research Report, Rutgers University, New Brunswick NJ, RRR 16--89 1989 |
514 |
P.L. Hammer, N.V.R. Mahadev Bithreshold graphs SIAM J. Discr. Math. 6 1985 497--506 ZMath 0974.05067 |
515 |
P.L. Hammer, N.V.R. Mahadev, D. de Werra The struction of a graph: application to CN--free graphs Combinatorica 5 1985 141--147 ZMath 0582.05051 |
516 |
P.L. Hammer, N.V.R. Mahadev, U.N. Peled Some properties of 2--threshold graphs Networks 19 1989 17--23 ZMath 0671.05059 |
517 |
P.L. Hammer, N.V.R. Mahadev, U.N. Peled Bipartite bithreshold graphs Discrete Math. 119 1993 79--96 ZMath 0790.05082 |
518 |
P.L. Hammer, B. Simeone The splittance of a graph Combinatorica 1 1981 275--284 ZMath 0492.05043 |
519 |
F. Harary On the group of the composition of two graphs Duke Math. J. 26 1959 29--34 ZMath 0085.37803 |
520 |
F. Harary Graph Theory Addison--Wesley, Reading, Mass. 1969 ZMath 0182.57702 |
521 |
F. Harary, J.A. Kabell, F.R. McMorris Bipartite intersection graphs Comment. Math. Univ. Carolin. 23 1982 739--745 ZMath 0516.05049 |
522 |
F. Harary, T.A. McKee The square of a chordal graph Discrete Math. 128 1994 165--172 ZMath 0795.05118 |
523 |
I.B. Hartman, I. Newman, R. Ziv On grid intersection graphs Discrete Math. 87 , 1991 41--52 ZMath 0739.05081 |
524 |
T.W. Haynes, S.T. Hedetniemi, P.J. Slater (eds.) Fundamentals of Domination in Graphs Marcel Dekker, New York, Basel , Vol. 208 1998 ZMath 0890.05002 |
525 |
T.W. Haynes, S.T. Hedetniemi, P.J. Slater (eds.) Domination in Graphs: Advanced Topics Pure and Applied Mathematics, Marcel Dekker. 209. New York, NY: Marcel Dekker. xii, 487 p. \$ 165.00 (1998). [ISBN 0-8247-0034-1/hbk] ZMath 0883.00011 |
526 |
R.B. Hayward Weakly triangulated graphs J. Comb. Theory (B) 39 1985 200--208 ZMath 0551.05055 |
527 |
R.B. Hayward Murky graphs J. Comb. Theory (B) 49 1990 200--235 ZMath 0643.05054 |
528 |
R.B. Hayward Discs in unbreakable graphs Graphs and Combinatorics 11 1995 249--254 ZMath 0833.05032 |
529 |
R.B. Hayward Meyniel weakly triangulated graphs -- I: co-perfect orderablity Discrete Appl. Math. 73 1997 199--210 ZMath 0878.05035 |
530 |
R.B. Hayward, C. Ho\`ang, F. Maffray Optimizing weakly triangulated graphs Graphs and Combinatorics 5 339--349, Erratum: 6 (1990) 33--35 1989 ZMath 0679.68082 |
531 |
R.B. Hayward, S. Hougardy, B. Reed Recognizing $P_4$--structures manuscript 1996 |
532 |
R.B. Hayward, W.J. Lenhart On the $P_4$--structure of perfect graphs IV. Partner graphs J. Comb. Theory (B) 48 1990 135--139 ZMath 0820.05026 |
533 |
X. He Efficient parallel algorithms for series--parallel graphs J. Algorithms 12 409--430 1991 ZMath 0726.68043 |
534 |
S.T. Hedetniemi, R. Laskar (eds.) Topics on domination Annals of Discrete Math. 48 1991 ZMath 0716.00005 |
535 |
P. Hell R\'etractions de graphes Ph. D. Thesis, {\sl Universit\'e de Montr\'eal} 1972 |
536 |
P. Hell, J. Bang--Jensen, J. Huang Local tournaments and proper circular arc graphs {\sl Intern. Symp. SIGAL},Lecture Notes in Comp. Sci. 450 1990 101--108 ZMath 0819.68088 |
537 |
P. Hell, I. Rival Absolute retracts and varieties of reflexive graphs Canad. J. Math. 39 1987 544--567 ZMath 0627.05039 |
538 |
P. Hell, F.S. Roberts Analogues of the Shannon capacity of a graph Annals of Discrete Math. 12 1982 155--168 ZMath 0501.05035 |
539 |
R.L. Hemminger, L.W. Beineke Line graphs and line digraphs In: {\sc L.W.~Beineke, R.T.~Wilson}, eds.,Selected Topics in Graph Theory I,Academic Press, London 1978 271--305 ZMath 0434.05056 |
540 |
P.B. Henderson, Y. Zalcstein A graph--theoretic characterization of the $PV_{chunk}$ class of synchronizing primatives SIAM J. Computing 6 1977 88--108 ZMath 0349.68022 |
541 |
U. Hennig \"Uber Toleranzgraphen Diploma Thesis, FB Mathematik, FU Berlin 1988 |
542 |
M.A. Henning Irredundance perfect graphs Discrete Math. 142 1995 107--120 ZMath 0832.05059 |
543 |
A. Hertz Slim graphs Graphs and Combinatorics 5 1989 149--157 ZMath 0677.05065 |
544 |
A. Hertz Bipartable graphs J. Comb. Theory (B) 45 1988 1--12 ZMath 0599.05050 |
545 |
A. Hertz Skeletal graphs -- a new class of perfect graphs Discrete Math. 78 1989 291--296 ZMath 0691.05047 |
546 |
A. Hertz Slender graphs J. Comb. Theory (B) 47 1989 231--236 ZMath 0634.05060 |
547 |
A. Hertz A fast algorithm for colouring Meyniel graphs J. Comb. Theory (B) 50 1990 231--240 ZMath 0658.05027 |
548 |
A. Hertz Bipolarizable graphs Discrete Math. 81 1990 25--32 ZMath 0699.05050 |
549 |
A. Hertz Most unbreakable murky graphs are bull--free Graphs and Combinatorics 9 1993 173--175 ZMath 0779.05027 |
550 |
A. Hertz Polynomially solvable cases for the maximum stable set problem Discrete Appl. Math. 60 1995 195--210 ZMath 0830.68099 |
551 |
A. Hertz, D. de Werra Perfectly orderable graphs are quasiparity: a short proof Discrete Math. 68 1988 111--113 ZMath 0632.05049 |
552 |
T. Hiraguchi On the dimension of partially ordered sets {\sl Sci. Rep. Kanazawa Univ. 1} 1951 77--94 ZMath 0468.06001 |
553 |
C.T. Ho\`ang Perfect Graphs Ph. D. Thesis, {\sl School of Computer Science, McGill University Montreal} 1985 |
554 |
C.T. Ho\`ang On the $P_4$-structure of perfect graphs II. Odd decompositions J. Comb. Theory (B) 39 1985 220--232 |
555 |
C.T. Ho\`ang On a conjecture of Meyniel J. Comb. Theory (B) 42 1987 302--312 ZMath 0634.05058 |
556 |
C.T. Ho\`ang Alternating orientation and alternating colouration of perfect graphs J. Comb. Theory (B) 42 1987 264--273 ZMath 0618.05039 |
557 |
C.T. Ho\`ang On the sibling structure of perfect graphs J. Comb. Theory (B) 49 1990 282--286 ZMath 0725.05060 |
558 |
C.T. Ho\`ang Recognition and optimization algorithms for co--triangulated graphs Forschungsinstitut f\"ur Diskrete Mathematik, Bonn, 1990 Tech. Report No. 90637-OR |
559 |
C.T. Ho\`ang On the two--edge--colourings of perfect graphs J. Graph Theory 19 1995 271--279 ZMath 0820.05025 |
560 |
C.T. Ho\`ang Some properties of minimal imperfect graphs Discrete Math. 160 1996 165--175 ZMath 0863.05055 |
561 |
C.T. Ho\`ang On the complexity of recognizing a class of perfectly orderable graphs Discrete Appl. Math. 66 1996 219--226 ZMath 0854.68044 |
562 |
C.T. Ho\`ang A note on perfectly orderable graphs Discrete Appl. Math. 65 1996 379--386 ZMath 0858.05095 |
563 |
C.T. Ho\`ang On the disk--structure of perfect graphs I. The paw--structure Tech. Report 97-01-04 Lakehead University, Thunder Bay, Ontario, Canada 0 |
564 |
C.T. Ho\`ang, S. Hougardy, F. Maffray On the $P_4$--structure of perfect graphs V. Overlap graphs J. Comb. Theory (B) 67 1996 212--237 ZMath 0871.05019 |
565 |
C.T. Ho\`ang, N. Khouzam On brittle graphs J. Graph Theory 12 1988 391--404 ZMath 0653.05059 |
566 |
C.T. Ho\`ang, V.B. Le On $P_4$--transversals of perfect graphs manuscript 1997 ZMath 0955.05047 |
567 |
C.T. Ho\`ang, V.B. Le Recognizing perfect 2--split graphs SIAM J. Discrete Math. 13, No.1, 48-55 (2000) ZMath 946.05042 |
568 |
C.T. Ho\`ang, V.B. Le $P_4$--colorings and $P_4$--bipartite graphs manuscript 1998 ZMath 0965.05041 |
569 |
C.T. Ho\`ang, F. Maffray Opposition graphs are strict quasi--parity graphs Graphs and Combinatorics 5 1989 83--85 ZMath 0669.05045 |
570 |
C.T. Ho\`ang, N.V.R. Mahadev A note on perfect orders Discrete Math. 74 77--84 1989 ZMath 0679.05066 |
571 |
C.T. Ho\`ang, B.A. Reed Some classes of perfectly orderable graphs J. Graph Theory 13 1989 445--463 ZMath 0676.05071 |
572 |
C.T. Ho\`ang, B.A. Reed $P_4$--comparability graphs Discrete Math. 74 1989 173--200 ZMath 0675.05067 |
573 |
W. Hochst\"attler, H. Schindler Recognizing $P_4$--extendible graphs in linear time % extended abstract, 4th Twente workshop 1995,Tech. Report 95.188, Universit\"at K\"oln, 1995 0 |
574 |
A.J. Hoffman A generalization of max flow--min cut 1974,Math. Programming 6 1974 352--359 ZMath 0357.90068 |
575 |
A.J. Hoffman On greedy algorithms that succeed Surveys in Combinatorics, London Mathematical Society Lecture Notes Series103, Cambridge University Press 1985 97--112 ZMath 0601.90111 |
576 |
A.J. Hoffman, A.W.J. Kolen, M. Sakarovitch Totally--balanced and greedy matrices SIAM J. Alg. Discr. Meth. 6 1985 721--730 ZMath 0573.05041 |
577 |
A.J. Hoffman On eigenvalues and colorings of graphs Graph Theory and Its Applications ({\sc B. Harries}, ed.), 0 Academic P ZMath 0221.05061 |
578 |
J.E. Hopcroft, R.E. Tarjan Planarity testing in ${\cal O}(|V| \log |V|)$ steps {\sl Information Process.} 72, Vol. 1, Foundations and Systems,North--Holland, Amsterdam 1972 85--90 ZMath 0254.05001 |
579 |
J.E. Hopcroft, R.E. Tarjan Efficient planarity testing J. ACM 21 1974 549--568 ZMath 0307.68025 |
580 |
S. Hougardy Inclusion diagram of perfect graph classes manuscript, 1994 |
581 |
S. Hougardy Even pairs and the strong perfect graph conjecture Discrete Math. 154 1996 277--278 ZMath 0848.05055 |
582 |
S. Hougardy On the $P_4$--Structure of Perfect Graphs {\sl Fachbereich Informatik, HU Berlin},Dissertation Thesis, 1995 |
583 |
S. Hougardy Perfect graphs with unique $P_4$--structure Discrete Math. 166 1997 411--420 ZMath 0886.05070 |
584 |
S. Hougardy, V.B. Le, A. Wagler Wing--triangulated graphs are perfect J. Graph Theory 24 1997 25--31 ZMath 0864.05034 |
585 |
E. Howorka A characterization of distance--hereditary graphs Quart. J. Math. Oxford Ser. 2, 28 1977 417--420 ZMath 0376.05040 |
586 |
E. Howorka On metric properties of certain clique graphs J. Comb. Theory (B) 27 1979 67--74 ZMath 0337.05138 |
587 |
E. Howorka A characterization of ptolemaic graphs J. Graph Theory 5 1981 323--331 ZMath 0437.05046 |
588 |
E. Howorka Betweenness in graphs {\sl Abstracts Amer. Math. Soc. 2, 783-06-5} 1981 |
589 |
W.--L. Hsu How to color claw--free perfect graphs Tech. Report No. 435, {\sl School of Operat. Research and Industrial Engineering,Cornell University, Ithaca, N.Y.} 1979 ZMath 0479.68067 |
590 |
W.--L. Hsu Decomposition of perfect graphs J. Comb. Theory (B) 43 1987 70--94 ZMath 0587.05037 |
591 |
W.--L. Hsu Recognizing planar perfect graphs J. ACM 34 1987 255--288 |
592 |
W.--L. Hsu ${\cal O}(m \cdot n)$ algorithms for the recognition and isomorphism problems on circular--arc graphs SIAM J. Computing 24 1995 411--439 ZMath 0831.68051 |
593 |
W.--L. Hsu A simple test for interval graphs Intern. Workshop on Graph--Theoretic Concepts in Comp. Sci. 1993, Lecture Notes in Comp. Sci. 657 ({\sc E.W. Mayr}, ed.) 0 11--16 ZMath 0789.68110 |
594 |
W.--L. Hsu ${\cal O}(M \cdot N)$ algorithms for the recognition and isomorphism problems on circular--arc graphs SIAM J. Computing 24 1995 411--439 ZMath 0831.68051 |
595 |
W.--L. Hsu On--line recognition of interval graphs in ${\cal O}(m+n\log n)$ time Lecture Notes in Comp. Sci. 1120 1995 27--38 |
596 |
W.--L. Hsu, T.H. Ma Substitution decomposition on chordal graphs and applications In: ISA'91 Algorithms ({\sc W.--L. Hsu, R.T.C. Lee}, eds.),Lecture Notes in Comp. Sci. 557 1991 52--60 |
597 |
W.--L. Hsu, T.H. Ma Fast and simple algorithms for recognizing chordal comparability graphs and interval graphs \SIAMJC, to appear 0 ZMath 0918.68047 |
598 |
W.--L. Hsu, G.L. Nemhauser Algorithms for minimum covering by cliques and maximum clique in claw--free perfect graphs Discrete Math. 37 1981 181--191 ZMath 0473.05049 |
599 |
M. Hujter, Z. Tuza Precoloring extensions III: Classes of perfect graphs Comb. Prob. Comp. 5 1996 35--56 ZMath 0846.05034 |