Sciweavers

Share
75 search results - page 1 / 15
» 2-factors with the bounded number of components in line grap...
Sort
View
JGT
2007
99views more  JGT 2007»
9 years 7 months ago
The upper bound of the number of cycles in a 2-factor of a line graph
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-fa...
Jun Fujisawa, Liming Xiong, Kiyoshi Yoshimoto, She...
DM
2007
149views more  DM 2007»
9 years 7 months ago
Even subgraphs of bridgeless graphs and 2-factors of line graphs
By Petersen’s theorem, a bridgeless cubic multigraph has a 2-factor. H. Fleischner generalised this result to bridgeless multigraphs of minimum degree at least three by showing ...
Bill Jackson, Kiyoshi Yoshimoto
GD
2005
Springer
10 years 20 days ago
Bar k-Visibility Graphs: Bounds on the Number of Edges, Chromatic Number, and Thickness
Let S be a set of horizontal line segments, or bars, in the plane. We say that G is a bar visibility graph, and S its bar visibility representation, if there exists a one-to-one co...
Alice M. Dean, William Evans, Ellen Gethner, Joshu...
CCCG
2004
9 years 8 months ago
On the number of line tangents to four triangles in three-dimensional space
We establish upper and lower bounds on the number of connected components of lines tangent to four triangles in R3 . We show that four triangles in R3 may admit at least 88 tangent...
Hervé Brönnimann, Olivier Devillers, S...
books