#### Filter Results:

#### Publication Year

2001

2015

#### Co-author

#### Key Phrase

#### Publication Venue

Learn More

- H J Broersma, J Fujisawa, L Marchal, D Paulusma, A N M Salman, K Yoshimoto
- 2006

Given an integer λ ≥ 2, a graph G = (V, E) and a spanning subgraph H of G (the backbone of G), a λ-backbone coloring of (G, 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 λ. We study the case where the backbone is either a collection of pair-wise disjoint stars or a matching.… (More)

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)

- H J Broersma, J Fujisawa, K Yoshimoto, Hajo Broersma, Jun Fujisawa, Kiyoshi Yoshimoto
- 2003

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)

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)

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.

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)

A weighted graph is a graph in which each edge e is assigned a non-negative number w(e), called the weight of e. The weight of a cycle is the sum of the weights of its edges. The weighted degree d w (v) of a vertex v is the sum of the weights of the edges incident with v. In this paper, we prove the following result: Suppose G is a 2-connected weighted… (More)

A graph is called a weighted graph when each edge e is assigned a nonnegative number w(e), called the weight of e. For a vertex v of a weighted graph, d w (v) is the sum of the weights of the edges incident with v. For a subgraph H of a weighted graph G, the weight of H is the sum of the weights of the edges belonging to H. In this paper, we give a new… (More)

- M Salman, H J Broersma, A J Mouthaan, R Boucherie, C Hoede, G J Woeginger +18 others
- 2005

No part of this work may be reproduced by print, photocopy or any other means without the permission in writing from the author. Preface In the name of Allaah, the Most Gracious and the Most Merciful. All the praises and thanks are to Allaah, the Lord of the 'aalamiin (mankind, jinn and all that exists). in three topics of graph theory, namely: spanning… (More)