The following pages link to Jou-Ming Chang (Q269717):
Displaying 50 items.
- Locally exchanged twisted cubes: connectivity and super connectivity (Q269721) (← links)
- The recognition of geodetically connected graphs (Q293190) (← links)
- Solving the all-pairs-shortest-length problem on chordal bipartite graphs (Q294620) (← links)
- A loopless algorithm for generating multiple binary tree sequences simultaneously (Q300220) (← links)
- Incidence coloring on hypercubes (Q300251) (← links)
- Constructing two completely independent spanning trees in hypercube-variant networks (Q338381) (← links)
- A comment on ``Independent spanning trees in crossed cubes'' (Q402393) (← links)
- A parallel algorithm for constructing independent spanning trees in twisted cubes (Q505426) (← links)
- Corrigendum to: ``Incidence coloring on hypercubes''. (Q517026) (← links)
- Ranking and unranking of non-regular trees with a prescribed branching sequence (Q552163) (← links)
- Amortized efficiency of generating planar paths in convex position (Q638510) (← links)
- A quadratic algorithm for finding next-to-shortest paths in graphs (Q639280) (← links)
- Independent spanning trees vs. edge-disjoint spanning trees in locally twisted cubes (Q656593) (← links)
- A fast parallel algorithm for constructing independent spanning trees on parity cubes (Q668143) (← links)
- Restricted power domination and fault-tolerant power domination on grids (Q708342) (← links)
- Two kinds of generalized 3-connectivities of alternating group networks (Q777262) (← links)
- Relationship between extra edge connectivity and component edge connectivity for regular graphs (Q784476) (← links)
- A new upper bound on the queuenumber of hypercubes (Q965977) (← links)
- Erratum to ``A new upper bound on the queuenumber of hypercubes'' [Discrete Math. 310, No. 4, 935-939 (2010; Zbl 1231.05190)] (Q973136) (← links)
- A note on ``An improved upper bound on the queue number of the hypercube'' (Q975418) (← links)
- On the diameter of geometric path graphs of points in convex position (Q976134) (← links)
- Upper bounds on the queue number of \(k\)-ary \(n\)-cubes (Q990104) (← links)
- Geodesic-pancyclicity and fault-tolerant panconnectivity of augmented cubes (Q1002284) (← links)
- Sorting a sequence of strong kings in a tournament (Q1014449) (← links)
- On the independent spanning trees of recursive circulant graphs \(G(cd^m,d)\) with \(d>2\) (Q1019176) (← links)
- Feedback vertex sets in star graphs (Q1029080) (← links)
- The interchange graphs of tournaments with minimum score vectors are exactly hypercubes (Q1043788) (← links)
- Distributed algorithms for finding the unique minimum distance dominating set in directed split-stars. (Q1398783) (← links)
- Induced matchings in asteroidal triple-free graphs (Q1414582) (← links)
- On the powers of graphs with bounded asteroidal number (Q1587600) (← links)
- Recognizing hinge-free line graphs and total graphs (Q1596464) (← links)
- Improving the diameters of completely independent spanning trees in locally twisted cubes (Q1621502) (← links)
- A parallel construction of vertex-disjoint spanning trees with optimal heights in star networks (Q1699757) (← links)
- The 4-component connectivity of alternating group networks (Q1731848) (← links)
- Constructing independent spanning trees on bubble-sort networks (Q1790945) (← links)
- A new way of counting \(n^ m\) (Q1903757) (← links)
- Reliability assessment of the Cayley graph generated by trees (Q2004067) (← links)
- A loopless algorithm for generating \((k, m)\)-ary trees in gray-code order (Q2037975) (← links)
- Constructing dual-CISTs with short diameters using a generic adjustment scheme on bicubes (Q2043017) (← links)
- Three completely independent spanning trees of crossed cubes with application to secure-protection routing (Q2053847) (← links)
- Improved algorithms for ranking and unranking \((k, m)\)-ary trees in B-order (Q2082174) (← links)
- Neighbor connectivity of pancake graphs and burnt pancake graphs (Q2097164) (← links)
- The generalized 4-connectivity of pancake graphs (Q2112653) (← links)
- Analysis on component connectivity of bubble-sort star graphs and burnt pancake graphs (Q2181218) (← links)
- Two-disjoint-cycle-cover bipancyclicity of balanced hypercubes (Q2185407) (← links)
- Comments on: ``A Hamilton sufficient condition for completely independent spanning tree'' (Q2192125) (← links)
- Constructing dual-CISTs of folded divide-and-swap cubes (Q2219061) (← links)
- The reliability analysis based on the generalized connectivity in balanced hypercubes (Q2223684) (← links)
- Parallel construction of multiple independent spanning trees on highly scalable datacenter networks (Q2246461) (← links)
- Amortized efficiency of generation, ranking and unranking left-child sequences in lexicographic order (Q2274095) (← links)
