The following pages link to Chang-hong Lu (Q511192):
Displaying 50 items.
- (Q247947) (redirect page) (← links)
- NP-completeness and APX-completeness of restrained domination in graphs (Q442103) (← links)
- A note on \(L (2, 1)\)-labelling of trees (Q511194) (← links)
- Identifying codes and locating-dominating sets on paths and cycles (Q642979) (← links)
- Vertex-coloring edge-weightings of graphs (Q647275) (← links)
- A conjecture on the number of SDRs of a \((t,n)\)-family (Q649001) (← links)
- The \(L(2,1)\)-\({\mathcal F}\)-labeling problem of graphs (Q652112) (← links)
- (Q861414) (redirect page) (← links)
- Path decomposition of graphs with given path length (Q861415) (← links)
- No-hole 2-distant colorings for Cayley graphs on finitely generated abelian groups (Q879397) (← links)
- On tight components and anti-tight components (Q897283) (← links)
- Labelling algorithms for paired-domination problems in block and interval graphs (Q987497) (← links)
- A linear-time algorithm for paired-domination problem in strongly chordal graphs (Q990092) (← links)
- Distance-two labellings of Hamming graphs (Q1026152) (← links)
- Constructive characterizations of \( (\gamma_p,\gamma)\)-and \( (\gamma_p, \gamma_{pr})\)-trees (Q1032812) (← links)
- Hardness results and approximation algorithms for (weighted) paired-domination in graphs (Q1034626) (← links)
- Distance paired-domination problems on subclasses of chordal graphs (Q1034627) (← links)
- On \((d,2)\)-dominating numbers of butterfly networks (Q1394475) (← links)
- On \((d,2)\)-dominating numbers of binary undirected de Bruijn graphs (Q1582075) (← links)
- The broadcast function value \(B(23)\) is \(33\) or \(34\). (Q1582579) (← links)
- \((d,m)\)-dominating numbers of hypercube (Q1607520) (← links)
- On container length and wide-diameter in undirectional hypercubes (Q1607720) (← links)
- Distance-two labelings of graphs (Q1869030) (← links)
- Vertices in all minimum paired-dominating sets of block graphs (Q1928534) (← links)
- Three conjectures on the signed cycle domination in graphs (Q1956250) (← links)
- A new property of binary undirected de Bruijn graphs (Q1976593) (← links)
- A bridge between the minimal doubly resolving set problem in (folded) hypercubes and the coin weighing problem (Q2065777) (← links)
- Algorithmic aspect on the minimum (weighted) doubly resolving set problem of graphs (Q2082215) (← links)
- Generalized power domination in claw-free regular graphs (Q2117535) (← links)
- Roman \(\{2\}\)-domination problem in graphs (Q2118251) (← links)
- Connectivity keeping caterpillars and spiders in 2-connected graphs (Q2222940) (← links)
- The pos/neg-weighted 1-median problem on tree graphs with subtree-shaped customers (Q2268861) (← links)
- Connectivity keeping trees in 2-connected graphs (Q2280001) (← links)
- The \(k\)-power domination problem in weighted trees (Q2290632) (← links)
- Extremal problems on consecutive \(L(2,1)\)-labelling (Q2370429) (← links)
- An extremal problem on non-full colorable graphs (Q2384400) (← links)
- Path covering number and \(L(2,1)\)-labeling number of graphs (Q2446849) (← links)
- The geodetic numbers of graphs and digraphs (Q2461517) (← links)
- On the number of increasing paths in labeled cycles and stars (Q2463992) (← links)
- Upper bounds for the paired-domination numbers of graphs (Q2631089) (← links)
- Approximation algorithms for a virtual machine allocation problem with finite types (Q2680235) (← links)
- (Q2752541) (← links)
- (Q2755696) (← links)
- (Q2804794) (← links)
- (Q3011737) (← links)
- (Q3148111) (← links)
- (Q3171038) (← links)
- (Q3404791) (← links)
- (Q3409643) (← links)
- (Q3537009) (← links)
