The following pages link to Jung-Heum Park (Q266948):
Displaying 31 items.
- Algorithms for finding disjoint path covers in unit interval graphs (Q266951) (← links)
- Paired many-to-many disjoint path covers in restricted hypercube-like graphs (Q284574) (← links)
- Paired many-to-many disjoint path covers in faulty hypercubes (Q391966) (← links)
- An approach to conditional diagnosability analysis under the PMC model and its application to torus networks (Q401484) (← links)
- Paired 2-disjoint path covers and strongly Hamiltonian laceability of bipartite hypercube-like graphs (Q497240) (← links)
- Disjoint path covers in recursive circulants \(G(2^m,4)\) with faulty elements (Q638530) (← links)
- Strong matching preclusion (Q653338) (← links)
- An optimal algorithm for finding the edge visibility polygon under limited visibility (Q673918) (← links)
- Longest paths and cycles in faulty star graphs (Q705576) (← links)
- A linear-time algorithm for finding a paired 2-disjoint path cover in the cube of a connected graph (Q730490) (← links)
- Panconnectivity and pancyclicity of hypercube-like interconnection networks with faulty elements (Q884473) (← links)
- Ore-type degree conditions for disjoint path covers in simple graphs (Q898138) (← links)
- Unpaired many-to-many disjoint path covers in restricted hypercube-like graphs (Q905847) (← links)
- Conditional matching preclusion for hypercube-like interconnection networks (Q1029332) (← links)
- On the number of guard edges of a polygon (Q1312196) (← links)
- On the construction of regular minimal broadcast digraphs (Q1318708) (← links)
- A linear-time algorithm for finding a one-to-many 3-disjoint path cover in the cube of a connected graph (Q1628689) (← links)
- Embedding trees in recursive circulants (Q1923603) (← links)
- Strong matching preclusion under the conditional fault model (Q1949116) (← links)
- Characterization of interval graphs that are unpaired 2-disjoint path coverable (Q2173303) (← links)
- Torus-like graphs and their paired many-to-many disjoint path covers (Q2217462) (← links)
- Fault-tolerant embedding of starlike trees into restricted hypercube-like graphs (Q2316931) (← links)
- Many-to-many two-disjoint path covers in cylindrical and toroidal grids (Q2341724) (← links)
- Disjoint path covers with path length constraints in restricted hypercube-like graphs (Q2402363) (← links)
- Disjoint path covers joining prescribed source and sink sets in interval graphs (Q2419125) (← links)
- Many-to-many two-disjoint path covers in restricted hypercube-like graphs (Q2441778) (← links)
- Single-source three-disjoint path covers in cubes of connected graphs (Q2444763) (← links)
- Disjoint path covers in cubes of connected graphs (Q2449141) (← links)
- Panconnectivity and edge-pancyclicity of faulty recursive circulant \(G(2^m,4)\) (Q2474073) (← links)
- Fault-Hamiltonicity of Product Graph of Path and Cycle (Q3082939) (← links)
- Paired 3-Disjoint Path Covers in Bipartite Torus-Like Graphs with Edge Faults (Q6132395) (← links)
