#### Filter Results:

- Full text PDF available (35)

#### Publication Year

1992

2017

- This year (2)
- Last 5 years (17)
- Last 10 years (39)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Robert E. L. Aldred, Jun Fujisawa, Akira Saito
- Journal of Graph Theory
- 2010

- Jun Fujisawa, Atsuhiro Nakamoto, Kenta Ozeki
- J. Comb. Theory, Ser. B
- 2013

Let G be a 3-connected bipartite graph with partite sets X ∪ Y which is em-beddable in the torus. We shall prove that G has a Hamiltonian cycle if (i) G is blanced , i.e., |X| = |Y |, and (ii) each vertex x ∈ X has degree four. In order to prove the result, we establish a result on orientations of quadrangular torus maps possibly with multiple edges. This… (More)

- S Shimizu, H Kitamura, T Ito, T Nakamura, J Fujisawa, H Matsukawa
- Pathology international
- 1998

Histiocytoid breast carcinoma (HBC) is a rare variant of breast carcinoma and often causes a diagnostic dilemma because of its histological similarities to some types of breast cancer and benign lesions. To elucidate the incidence of HBC and its biological properties, histological specimens from 1010 breast cancer patients treated at Yokohama Minami Kyosai… (More)

- Jun Fujisawa, Katsuhiro Ota
- Australasian J. Combinatorics
- 2006

A weighted graph is one in which every edge e is assigned a nonnegative number, called the weight of e. The weight of a graph is defined as the sum of the weights of its edges. In 2-edge-colored complete graph, by using Ramsey-type theorems, we obtain the existence of monochromatic subgraph which have many edges compared with its order. In this paper, we… (More)

- Y Okada, H Sawa, +8 authors K Nagashima
- The Journal of biological chemistry
- 2000

Polyomavirus JC (JCV) causes the human demyelinating disease, progressive multifocal leukoencephalopathy (PML). The recent demonstration of cases of PML in association with human T-lymphotropic virus type I (HTLV-I) infection prompted us to examine whether the HTLV-I-encoded regulatory protein Tax activates JCV transcription. By employing a dual luciferase… (More)

- Jun Fujisawa, Liming Xiong, Kiyoshi Yoshimoto, Shenggui Zhang
- Journal of Graph Theory
- 2007

Let G be a simple graph with order n and minimum degree at least two. In this paper, we prove that if every odd branch-bond in G has an edge-branch, then its line graph has a 2-factor with at most 3n−2 8 components. For a simple graph with minimum degree at least three also, the same conclusion holds.

- Robert E. L. Aldred, Yoshimi Egawa, Jun Fujisawa, Katsuhiro Ota, Akira Saito
- Journal of Graph Theory
- 2011

Ota and Tokuda [2] gave a minimum degree condition for a K1,n-free graph to have a 2-factor. Though their condition is best-possible, their sharpness examples have edge-connectivity one. In this paper, we improve their minimum degree condition for K1,n-free graphs with large connectivity or large edge-connectivity. Our bound is sharp, and together with Ota… (More)

Given a graph G = (V, E) and a spanning subgraph H of G (the backbone of G), a backbone coloring for G and H is a proper vertex coloring V → {1, 2,. . .} of G in which the colors assigned to adjacent vertices in H differ by at least two. In a recent paper, backbone colorings were introduced and studied in cases were the backbone is either a spanning tree or… (More)

- E Ikebe, A Kawaguchi, +20 authors H Iha
- Blood cancer journal
- 2013

In the peripheral blood leukocytes (PBLs) from the carriers of the human T-lymphotropic virus type-1 (HTLV-1) or the patients with adult T-cell leukemia (ATL), nuclear factor kappaB (NF-κB)-mediated antiapoptotic signals are constitutively activated primarily by the HTLV-1-encoded oncoprotein Tax. Tax interacts with the I κB kinase regulatory subunit NEMO… (More)

- Jun Fujisawa, Akira Saito
- Combinatorics, Probability & Computing
- 2012

In this paper, we consider pairs of forbidden subgraphs that imply the existence of a 2-factor in a graph. For d ≥ 2, let G d be the set of connected graphs of minimum degree at least d. Let F 1 and F 2 be connected graphs and let H be a set of connected graphs. Then {F 1 , F 2 } is said to be a forbidden pair for H if every {F 1 , F 2 }-free graph in H of… (More)