Sciweavers

458 search results - page 5 / 92
» Totally magic graphs
Sort
View
DM
2008
72views more  DM 2008»
13 years 7 months ago
(p, 1)-Total labelling of graphs
A (p, 1)-total labelling of a graph G is an assignment of integers to V (G) E(G) such that: (i) any two adjacent vertices of G receive distinct integers, (ii) any two adjacent ed...
Frédéric Havet, Min-Li Yu
ISAAC
1992
Springer
186views Algorithms» more  ISAAC 1992»
13 years 11 months ago
Algorithms for Finding Non-Crossing Paths with Minimum Total Length in Plane Graphs
Let G be an undirected plane graph with non-negative edge length, and let k terminal pairs lie on two specified face boundaries. This paper presents an algorithm for finding k &quo...
Jun-ya Takahashi, Hitoshi Suzuki, Takao Nishizeki
COMBINATORICA
1998
77views more  COMBINATORICA 1998»
13 years 7 months ago
A Bound on the Total Chromatic Number
We prove that the total chromatic number of any graph with maximum degree is at most plus an absolute constant. In particular, we show that for su ciently large, the total chromat...
Michael Molloy, Bruce A. Reed
SCALESPACE
2007
Springer
14 years 1 months ago
Total Variation Minimization and Graph Cuts for Moving Objects Segmentation
Florent Ranchin, Antonin Chambolle, Françoi...
COMBINATORICA
2007
51views more  COMBINATORICA 2007»
13 years 7 months ago
Total Colorings Of Degenerate Graphs
Shuji Isobe, Xiao Zhou, Takao Nishizeki