The following pages link to Wai-Kai Chen (Q592071):
Displayed 50 items.
- Notes on cycles through a vertex or an arc in regular 3-partite tournaments (Q427703) (← links)
- Facial parity 9-edge-coloring of outerplane graphs (Q497307) (← links)
- The edge density of critical digraphs (Q519953) (← links)
- The orientation number of two complete graphs with linkages (Q556840) (← links)
- Flows in circulant graphs of odd order are sums of Hamilton cycles (Q583084) (← links)
- The complexity of finding two disjoint paths with min-max objective function (Q584275) (← links)
- Item:Q592071 (redirect page) (← links)
- Descendant-homogeneous digraphs (Q618299) (← links)
- A recurrence for bounds on dominating sets in \(k\)-majority tournaments (Q640421) (← links)
- Cycles in \(k\)-traceable oriented graphs (Q641171) (← links)
- On the differences between Szeged and Wiener indices of graphs (Q641199) (← links)
- On properties of random dissections and triangulations (Q653837) (← links)
- Destroying cycles in digraphs (Q653984) (← links)
- On the spectral moment of quasi-trees (Q665920) (← links)
- On the feedback vertex set problem for a planar graph (Q678111) (← links)
- A note on the number of perfect matchings of bipartite graphs (Q678856) (← links)
- The fractional chromatic number of the plane (Q722307) (← links)
- Item:Q592071 (redirect page) (← links)
- A lower bound for the interval number of a graph (Q788751) (← links)
- Hamiltonian decompositions of complete graphs (Q795057) (← links)
- Regular factors in nearly regular graphs (Q795844) (← links)
- Generation of trees of a graph with the use of decomposition (Q800368) (← links)
- Diameter vulnerability of graphs (Q800372) (← links)
- A combinatorial model for the homfly polynomial (Q810041) (← links)
- A lower bound for the recognition of digraph properties (Q810043) (← links)
- Enumeration of digraphs with given number of vertices of odd out-degree and vertices of odd in-degree (Q810045) (← links)
- Minimum cost homomorphism dichotomy for oriented cycles (Q844220) (← links)
- Score sets in \(k\)-partite tournaments (Q854436) (← links)
- The tail is cut for Ramsey numbers of cubes (Q864173) (← links)
- Packing of two digraphs into a transitive tournament (Q868371) (← links)
- Total restrained domination in trees (Q879341) (← links)
- Matchings in 3-vertex-critical graphs: the odd case (Q879342) (← links)
- Vertex pancyclicity in quasi claw-free graphs (Q879347) (← links)
- Uniform coverings of 2-paths with 4-cycles (Q896103) (← links)
- Applications of lattice theory to graph decomposition (Q911609) (← links)
- Mathematical theory of broadband matching of multiport networks (Q922357) (← links)
- On complex-normalized reflection coefficients (Q922461) (← links)
- Explicit formulae for element values of a lossless low-pass ladder network and their use in the design of a broadband matching network (Q922473) (← links)
- Broad-band impedance matching of the RLC generator and load (Q922499) (← links)
- Hoàng-Reed conjecture holds for tournaments (Q932618) (← links)
- Paths partition with prescribed beginnings in digraphs: A Chvátal-Erdős condition approach (Q941336) (← links)
- Turán theorems and convexity invariants for directed graphs (Q941398) (← links)
- Kernels in edge-coloured orientations of nearly complete graphs (Q941406) (← links)
- Reachability relations in digraphs (Q942126) (← links)
- Two proofs of the Bermond-Thomassen conjecture for tournaments with bounded minimum in-degree (Q960967) (← links)
- Smallest counterexample to the 5-flow conjecture has girth at least eleven (Q974466) (← links)
- Ternary codes from graphs on triples (Q1044933) (← links)
- Orientations with single source and sink (Q1057281) (← links)
- The 2-linkage problem for acyclic digraphs (Q1057282) (← links)
- A note about a theorem by Maamoun on decompositions of digraphs into elementary directed paths or cycles (Q1066157) (← links)