D. Kratsch, T. Kloks, H. M uller, Computing the toughness and the scattering number for interval and other graphs, IRISA Report PI-806, p. 19, 1994. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
On P_4-tidy graphs - Giakoumakis, Roussel, Thuillier (1997) (Correct)
....if and only if t (G) 1, and 0 if and only if t (G) 1. Since for any proper subset S of vertices of a Hamiltonian graph G # S , for such a graph s(G) 0 (or equivalently t (G) 1) We note that the problem: Given a graph G and an integer k, decide whether s(G) k is NP complete (see [27]) For a graph G we shall denote by #(G) the minimum number of elementary disjoint paths which cover V (G) i.e. the minimum path partition number of G, or simply the path number of G) Skupie n [32] studied some graphs whose scattering number is #(G) and Jung [25] studied relationships between ....
D. Kratsch, T. Kloks, H. M uller, Computing the toughness and the scattering number for interval and other graphs, IRISA Report PI-806, p. 19, 1994.
On P_4-tidy graphs - Giakoumakis, Roussel, Thuillier (1997) (Correct)
....and s(G) 0 if and only if t (G) 1. Since for any proper subset S of vertices of a Hamiltonian graph G c(G S) # S , for such a graph s(G) # 0 (or equivalently t (G) # 1) We note that the problem: Given a graph G and an integer k, decide whether s(G) # k is NP complete (see [27]) For a graph G we shall denote by #(G) the minimum number of elementary disjoint paths which cover V (G) i.e. the minimum path partition number of G, or simply the path number of G) Skupie n [32] studied some graphs whose scattering number is #(G) and Jung [25] studied relationships between ....
D. Kratsch, T. Kloks, H. M uller, Computing the toughness and the scattering number for interval and other graphs, IRISA Report PI-806, p. 19, 1994.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC