Sciweavers

JGT
2007
99views more  JGT 2007»
13 years 11 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...
JGT
2007
74views more  JGT 2007»
13 years 11 months ago
About paths with two blocks
Amine El Sahili, Mekkia Kouider
JGT
2007
49views more  JGT 2007»
13 years 11 months ago
Independent sets in tensor graph powers
Noga Alon, Eyal Lubetzky
JGT
2007
50views more  JGT 2007»
13 years 11 months ago
More intrinsically knotted graphs
We demonstrate four intrinsically knotted graphs that do not contain each other, nor any previously known intrinsically knotted graph, as a minor.
Joel Foisy
JGT
2007
85views more  JGT 2007»
13 years 11 months ago
Coloring quasi-line graphs
A graph G is a quasi-line graph if for every vertex v, the set of neighbors of v can be expressed as the union of two cliques. The class of quasi-line graphs is a proper superset ...
Maria Chudnovsky, Alexandra Ovetsky
JGT
2007
87views more  JGT 2007»
13 years 11 months ago
A new upper bound on the cyclic chromatic number
A cyclic colouring of a plane graph is a vertex colouring such that vertices incident with the same face have distinct colours. The minimum number of colours in a cyclic colouring...
Oleg V. Borodin, Hajo Broersma, Alexei N. Glebov, ...
JGT
2007
40views more  JGT 2007»
13 years 11 months ago
Simultaneous diagonal flips in plane triangulations
Prosenjit Bose, Jurek Czyzowicz, Zhicheng Gao, Pat...
JGT
2007
69views more  JGT 2007»
13 years 11 months ago
The size of minimum 3-trees
A 3-uniform hypergraph is called a minimum 3-tree, if for any 3-coloring of its vertex set there is a heterochromatic triple and the hypergraph has the minimum possible number of ...
Jorge L. Arocha, Joaquín Tey
JGT
2007
112views more  JGT 2007»
13 years 11 months ago
The 2-dimensional rigidity of certain families of graphs
Laman’s characterization of minimally rigid 2-dimensional generic frameworks gives a matroid structure on the edge set of the underlying graph, as was first pointed out and expl...
Bill Jackson, Brigitte Servatius, Herman Servatius