Sciweavers

1749 search results - page 69 / 350
» Conditional colorings of graphs
Sort
View
GG
2010
Springer
15 years 7 months ago
Local Confluence for Rules with Nested Application Conditions
Abstract. Local confluence is an important property in many rewriting and transformation systems. The notion of critical pairs is central for being able to verify local confluence ...
Hartmut Ehrig, Annegret Habel, Leen Lambers, Ferna...
DM
2011
202views Education» more  DM 2011»
14 years 10 months ago
Two-ended regular median graphs
We show that regular median graphs of linear growth are the Cartesian product of finite hypercubes with the two-way infinite path. Such graphs are Cayley graphs and have only tw...
Wilfried Imrich, Sandi Klavzar
ICIP
1998
IEEE
16 years 8 months ago
Lip Features Automatic Extraction
An algorithm for speaker's lip segmentation and features extraction is presented in this paper. A color video sequence of speaker's face is acquired, under natural light...
Franck Luthon, Marc Liévin
CORR
2010
Springer
93views Education» more  CORR 2010»
15 years 6 months ago
Injective colorings of graphs with low average degree
Let mad(G) denote the maximum average degree (over all subgraphs) of G and let i(G) denote the injective chromatic number of G. We prove that if 4 and mad(G) < 14 5 , then i(G...
Daniel W. Cranston, Seog-Jin Kim, Gexin Yu
DM
2010
78views more  DM 2010»
15 years 6 months ago
Injective colorings of sparse graphs
Let Mad(G) denote the maximum average degree (over all subgraphs) of G and let i(G) denote the injective chromatic number of G. We prove that if Mad(G) 5 2 , then i(G) + 1; sim...
Daniel W. Cranston, Seog-Jin Kim, Gexin Yu