Front Cover; Proceedings of the First Japan Conference on Graph Theory and Applocations; Copyright Page; Contents; Preface; Chapter 1. Highly irregular m-chromatic graphs; Chapter 2. Explicit construction of linear sized tolerant networks; Chapter 3. Sorting in rounds; Chapter 4. On edge-Hamiltonian property of Cayley graphs; Chapter 5. Gallai theorems for graphs, hypergraphs, and set systems; Chapter 6. Edge-packings of graphs and network reliability; Chapter 7. Two Hamilton cycles in bipartite reflective Kneser graphs; Chapter 8. A result on generalized Latin rectangles

Chapter 9. Problems and results in combinatorial analysis and graph theoryChapter 10. Clique partitions and clique coverings; Chapter 11. Extremal theory and bipartite graph-tree Ramsey numbers; Chapter 12. On conjectures of Graffiti; Chapter 13. Small order graph-tree Ramsey numbers; Chapter 14. Enumerating phylogenetic trees with multiple labels; Chapter 15. Triad count statistics; Chapter 16. Score sequences: lexicographic enumeration and tournament construction; Chapter 17. Problems on chain partitions; Chapter 18. A solution to the Misere Shannon switching game

Chapter 19. A graph-theoretical characterization of the order complexes on the 2-sphereChapter 20. Hard graphs for the maximum clique problem; Chapter 21. Doubly regular asymmetric digraphs; Chapter 22. Ordering of the elements of a matroid such that its consecutive w elements are independent; Chapter 23. An existential problem of a weight-controlled subset and its application to school timetable construction; Chapter 24. More non-reconstructible hypergraphs; Chapter 25. Constructions of sensitive graphs which are not strongly sensitive

Chapter 26. Combinatorial resolution of systems of differential equations. IV. Separation of variablesChapter 27. Labeling angles of planar graphs; Chapter 28. Maximal induced trees in sparse random graphs; Chapter 29. Generalizations of critical connectivity of graphs; Chapter 30. On the Euclidean dimension of a complete multipartite graph; Chapter 31. Computation of some Cayley diagrams; Chapter 32. Short cycles in digraphs; Chapter 33. Subgraph counts in random graphs using incomplete U-statistics methods; Chapter 34. Toughness and matching extension in graphs

Chapter 35. Bipartite graphs obtained from adjacency matrices or orientations of graphsChapter 36. Cn-factors of group graphs; Chapter 37. An algorithm for solving the jump number problem; Chapter 38. Large scale network analysis with applications to transportation, communication and inference networks; Chapter 39. On the nonseparating independent set problem and feedback set problem for graphs with no vertex degree exceeding three; Chapter 40. p3-factorization of complete bipartite graphs; Chapter 41. n-graphs; Chapter 42. On point-linear arboricity of planar graphs