The following pages link to Hian Poh Yap (Q1164054):
Displaying 50 items.
- On a theorem about vertex colorings of graphs (Q579272) (← links)
- (Q589335) (redirect page) (← links)
- (Q593415) (redirect page) (← links)
- On 3-colorings of \(E(K_ n)\) (Q685557) (← links)
- The total chromatic number of graphs having large maximum degree (Q686156) (← links)
- Recent results on the total chromatic number (Q686483) (← links)
- All trees are 1-embeddable and all except stars are 2-embeddable (Q687137) (← links)
- On the automorphism groups of edge-coloured digraphs (Q750453) (← links)
- (Q787151) (redirect page) (← links)
- Chromatic index critical graphs of order 9 (Q787152) (← links)
- Determining the total colouring number is NP-hard (Q909667) (← links)
- Two-colorings of a dense subgroup of \({\mathbb{Q}}^ n\) that forbid many distances (Q913798) (← links)
- Variations on a scheme of McFarland for noncyclic difference sets (Q1069946) (← links)
- Independent sets in k-chromatic graphs (Q1076033) (← links)
- \(K_ 5\) is the only double-critical 5-chromatic graph (Q1088672) (← links)
- Recent progress on edge-colouring graphs (Q1090683) (← links)
- The complexity of multicolouring (Q1113919) (← links)
- Two conjectures on edge-colouring (Q1123197) (← links)
- On graphs whose maximal subgraphs have at most two orbits (Q1158164) (← links)
- On graphs critical with respect to edge-colourings (Q1164055) (← links)
- NP-completeness of graph decomposition problems (Q1179032) (← links)
- An \(\Omega{} (n^{5/4})\) lower bound on the randomized complexity of graph properties (Q1180407) (← links)
- An \(\Omega{} (n^{4/3})\) lower bound on the randomized complexity of graph properties (Q1180414) (← links)
- A constructive proof of Vizing's theorem (Q1186590) (← links)
- Expected parallel time and sequential space complexity of graph and digraph problems (Q1186789) (← links)
- A decomposition of strongly unimodular matrices into incidence matrices of digraphs (Q1193711) (← links)
- Packing three copies of a tree into a complete graph (Q1209730) (← links)
- Some remarks on E- minimal graphs (Q1235719) (← links)
- Chromatic-index-critical graphs of orders 11 and 12 (Q1277310) (← links)
- On the deficiency of bipartite graphs (Q1293200) (← links)
- Total colorings of equibipartite graphs (Q1297471) (← links)
- Edge colouring of \(K_{2n}\) with spanning star-forests receiving distinct colours (Q1300004) (← links)
- Total chromatic number of graphs of odd order and high degree (Q1301827) (← links)
- Induced cycles and chromatic number (Q1306304) (← links)
- Mutual placement of bipartite graphs (Q1309454) (← links)
- A sufficient condition for equitable edge-colourings of simple graphs (Q1322183) (← links)
- Star chromatic number of triangle-free planar graphs (Q1324451) (← links)
- Subtrees and subforests of graphs (Q1328385) (← links)
- Embedding graphs of small size (Q1329826) (← links)
- The number of cycles in a Hamilton graph (Q1336706) (← links)
- Cayley, Marty and Schreier hypergraphs (Q1341254) (← links)
- Counterexamples to a conjecture about bottlenecks in non-Tait-colourable cubic graphs (Q1356437) (← links)
- Defining sets in vertex colorings of graphs and latin rectangles (Q1356483) (← links)
- Chromatic uniqueness in a family of 2-connected graphs (Q1356689) (← links)
- The total chromatic number of pseudo-outerplanar graphs (Q1377186) (← links)
- On the structure and chromaticity of graphs in which any two colour classes induce a tree (Q1377681) (← links)
- Extending fixed vertex-colourings to total colourings (Q1377889) (← links)
- A chromatic partition polynomial (Q1381837) (← links)
- The maximal clique and colourability of curve contact graphs (Q1382253) (← links)
- Corrigendum to: On graphs critical with respect to edge-colourings (Q1813739) (← links)
