Publications
Papers in T.R.
J. Huang, Representation Characterizations of Chordal Bipartite
Graphs, Preprint (2003) DMS-885-IR, Department of
Mathematics and Statistics, University of Victoria.
J. Bang-Jensen, J. Huang, and L. Ibarra, Recognizing and
Representing Proper Interval Graphs In Parallel Using Sorting,
Preprint (2002) DMS-853-IR, Department of Mathematics and Statistics,
University of Victoria.
P. Hell and J. Huang, Interval Bigraphs and Circular Arc Graphs,
Preprint (2002) DMS-852-IR, Department of
Mathematics and Statistics, University of Victoria.
T. Feder, P. Hell, and J. Huang, Bi-Arc Graphs and the Complexity
of List Homomorphisms, Preprint (2001) DMA-850-IR, Department of
Mathematics and Statistics, University of Victoria.
J. Bang-Jensen and J. Huang, Convex-round Graphs Are Circular
Perfect, Preprints 2000, Institut for Matematik og Datalogi, SDU.
J. Bang-Jensen, J. Huang, and A. Yeo, Finding Small k-arc-strong
Spanning Subdigraphs in k-arc-strong Tournaments, Preprints 2000, No 7,
Institut for Matematik og Datalogi, SDU.
J. Bang-Jensen, J. Huang, and A. Yeo, Strongly Connected Spanning
Subgraphs with the Minimum Number of Arcs in Quasi-transitive Digraphs,
Technical Report 5/99, Department of Mathematics and Computer Science,
Odense University.
L. Caccetta, S. El-Batanouny, and J. Huang, On Vertex Critical
Graphs with Prescribed Diameter,
Technical Report 13/97, Curtin University of Technology.
L. Caccetta, E. Hartman, and J. Huang, Concerning the Number of
Edges in a Graph with Diameter Constraints,
Technical Report 10/97, Curtin University of Technology
J. Huang and A. Yeo, Maximal and Minimal Vertex-critical Graphs of
Diameter Two,
Technical Report 11/97, Curtin University of Technology.
J. Bang-Jensen, J. Huang, and A. Yeo, Round Graphs,
Technical Report 6/97, Curtin University of Technology.
L. Caccetta and J. Huang, The Maximum Degree of a Critical Graph
of Diameter Two,
Technical Report 22/96, Curtin University of Technology.
J. Bang-Jensen and J. Huang, Kings in Quasi-transitive Digraphs,
Preprints 1993, No. 33, Odense Universitet.
J. Bang-Jensen and J. Huang, Quasi-transitive Digraphs,
Preprints 1993, No. 27, Odense Universitet.
J. Bang-Jensen, G. Gutin, and J. Huang, Weakly Hamiltonian-connected
Ordinary Multipartite Tournaments,
Preprints 1993, No. 19, Odense Universitet.
P. Hell and J. Huang, Lexicographic Orientation and Representation
Algorithms for Comparability Graphs, Proper Circular Arc Graphs, and
Proper Interval Graphs,
Preprints 1993, No. 17, Odense Universitet.
J. Bang-Jensen, G. Gutin, and J. Huang, A Sufficient Condition for
a Complete Multipartite Digraph to be Hamiltonian,
Preprints 1993, No. 16, Odense Universitet.
P. Hell and J. Huang, Optimal Algorithms for q-Colouring and for
Finding Maximum Cliques in Proper Circular Arc Graphs,
Preprints 1993, No. 9, Odense Universitet.
X. Deng, P. Hell, and J. Huang, Linear Time Representation Algorithms
for Proper Circular Arc Graphs and Proper Interval Graphs,
Preprints 1993, No. 6, Odense Universitet.
J. Bang-Jensen, P. Hell, and J. Huang, Optimal Recognition of
Local Tournaments,
Preprints 1993, No. 4, Odense Universitet.
J. Huang, Structure Theorems on Local Tournaments,
Preprints 1993, No. 3, Odense Universitet.
J. Bang-Jensen, J. Huang, and E. Prisner, In-tournament Digraphs,
Preprints 1992, No. 6, Odense Universitet.
J. Bang-Jensen, J. Huang, and E. Prisner, In-tournament Digraphs,
Preprints 1992, No. 6, Odense Universitet.
J. Bang-Jensen, J. Huang, and E. Prisner, In-tournaments,
Preprint 91 - 030 (1991), Universit\"at Bielefeld.
J. Bang-Jensen, P. Hell, and J. Huang, Local Tournaments and
Proper Circular Arc Graphs, CSS/LCCR TR 90 - 11, Simon Fraser University,
Revised August 1990.
J. Huang and W. Li, Kings in Tournaments,
C.R.I. Journal 3 (1985).
Unpublished manuscripts
J. Huang, The Existence of Highly Regular and Highly Connected
Diameter Vertex-critical Graphs.
Back to Dr. Huang's Home Page