Stephen K. Wismath
ABSTRACT
Line-of-sight graphs were introduced by Garey, Johnson and So in connection with a circuit testing problem. A restricted version of the problem (using line segments and a single line-of-sight) is discussed and the associated graphs are characterized. Results for directed and weighted cases are also presented.
- [A] Algorithmic Aspects of Combinatorics, Annals of Discrete Math. 2 (1978), North Holland Publishing Co., p. 243.Google Scholar
- [Even] Even, S., Tarjan, R.; Computing an s-t Numbering: Theoretical Comp. Sci. 2 (1976), pp. 339-344.Google ScholarCross Ref
- [GJS] Garey, M., Johnson, D., So, H.; An Application of Graph Coloring to Printed Circuit Testing; IEEE Trans. on Circuits and Systems, Vol. CAS23, No. 10, Oct. 1976, pp. 591-598.Google Scholar
Index Terms
- Characterizing bar line-of-sight graphs
Recommendations
Collapsible graphs and Hamiltonian connectedness of line graphs
Thomassen conjectured that every 4-connected line graph is Hamiltonian. Chen and Lai [Z.-H. Chen, H.-J. Lai, Reduction techniques for super-Eulerian graphs and related topics-an update, in: Ku Tung-Hsin (Ed.), Combinatorics and Graph Theory, vol. 95, ...
Collapsible Graphs and Hamiltonicity of Line Graphs
Thomassen conjectured that every 4-connected line graph is Hamiltonian. Chen and Lai (Combinatorics and Graph Theory, vol 95, World Scientific, Singapore, pp 53---69; Conjecture 8.6 of 1995 ) conjectured that every 3-edge connected and essentially 6-...
On 3-connected hamiltonian line graphs
Thomassen conjectured that every 4-connected line graph is hamiltonian. It has been proved that every 4-connected line graph of a claw-free graph, or an almost claw-free graph, or a quasi-claw-free graph, is hamiltonian. In 1998, Ainouche et al. [2] ...
Comments