The following pages link to Khee Meng Koh (Q186280):
Displaying 50 items.
- (Q230781) (redirect page) (← links)
- The gracefulness of the join of graphs. II (Q322012) (← links)
- Power domination of the Cartesian product of graphs (Q322042) (← links)
- The gracefulness of the join of graphs (Q324910) (← links)
- The \(\mathbb{N}_k\)-valued Roman domination and its boundaries (Q324921) (← links)
- Dominating broadcast labeling in Cartesian products of graphs (Q324960) (← links)
- On the size of graphs of class 2 whose cores have maximum degree two (Q367049) (← links)
- An upper bound for the total restrained domination number of graphs (Q367057) (← links)
- The orientation number of two complete graphs with linkages (Q556840) (← links)
- On the lattice of maximum-sized antichains of a finite poset (Q585231) (← links)
- On an isomorphism problem on the closed-set lattice of a graph (Q761474) (← links)
- On the length of the sublattice-lattice of a finite distributive lattice (Q786840) (← links)
- On the strong purity of the sublattice-lattice of a finite distributive lattice (Q791553) (← links)
- On the sublattice-lattice of a lattice (Q796556) (← links)
- The search for chromatically unique graphs (Q803145) (← links)
- Vertex-gluings of sensitive graphs (Q810049) (← links)
- Bounds for the coefficients of flow polynomials (Q875944) (← links)
- Two classes of chromatically unique graphs (Q911611) (← links)
- The maximum number of maximal independent sets in unicyclic connected graphs (Q932626) (← links)
- On planar and non-planar graphs having no chromatic zeros in the interval(1,2) (Q932643) (← links)
- Domination numbers and zeros of chromatic polynomials (Q952654) (← links)
- On a construction of critical graphs which are not sensitive (Q1064327) (← links)
- On the uniformity of the closed-set lattice of a tree (Q1076680) (← links)
- Maximum-sized antichains in minimal posets (Q1081623) (← links)
- Lattices and their sublattice-lattices (Q1087571) (← links)
- Products of graphs with their closed-set lattices (Q1119944) (← links)
- Some problems on graph theory (Q1132115) (← links)
- An algorithm for finding all cliques in a finite distributive lattice (Q1135296) (← links)
- Idempotent algebras with three essentially binary polynomials (Q1137605) (← links)
- The chromatic uniqueness of certain broken wheels (Q1182985) (← links)
- On the Frattini sublattice of a finite modular planar lattice (Q1219310) (← links)
- An algorithm for determining \(\Phi(L)\) in finite distributive lattices (Q1250232) (← links)
- Structures and chromaticity of some extremal 3-colourable graphs (Q1301656) (← links)
- On chromatic uniqueness of uniform subdivisions of graphs (Q1322194) (← links)
- Chromatic classes of 2-connected \((n,n+3)\)-graphs with at least two triangles (Q1322232) (← links)
- Non-chordal graphs having integral-root chromatic polynomials. II (Q1348126) (← links)
- The number of kings in a multipartite tournament (Q1356480) (← links)
- On graphs in which any pair of colour classes but one induces a tree (Q1357722) (← links)
- The search for chromatically unique graphs. II (Q1366778) (← links)
- Addendum to: The diameter of an orientation of a complete multipartite graph [Discrete Math. 149 (1996) 131--139] (Q1367048) (← links)
- Optimal orientations of products of paths and cycles (Q1377664) (← links)
- On the structure and chromaticity of graphs in which any two colour classes induce a tree (Q1377681) (← links)
- \(H\)-domination in graphs (Q1415548) (← links)
- Divisibility of certain coefficients of the chromatic polynomials. (Q1420611) (← links)
- Chromatically unique multibridge graphs (Q1422157) (← links)
- On optimal orientations of \(G\) vertex-multiplications (Q1567670) (← links)
- An attempt to classify bipartite graphs by chromatic polynomials (Q1579550) (← links)
- On optimal orientations of Cartesian products of graphs. I (Q1584382) (← links)
- Chromatically unique bipartite graphs with low 3-independent partition numbers (Q1586760) (← links)
- Constructions of sensitive graphs which are not strongly sensitive (Q1813202) (← links)
