Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

86

JCT
2000

65views more JCT 2000»

Vertex Partitions by Connected Monochromatic k-Regular Graphs

15 years 2 months ago

Vertex Partitions by Connected Monochromatic k-Regular Graphs

Download web.cs.wpi.edu

Gábor N. Sárközy, Stanley M. Se

Real-time Traffic

JCT 2000 |

claim paper

Related Content

» Approximability of partitioning graphs with supply and demand

» Vertex partitions of chordal graphs

» Partitioning a Multiweighted Graph to Connected Subgraphs of Almost Uniform Size

» Partitioning a graph of bounded treewidth to connected subgraphs of almost uniform size

» Partitioning graphs of supply and demand

» Finding small balanced separators

» Minimum Clique Partition in Unit Disk Graphs

» Online vertexcoloring games in random graphs

» Vertex neighborhoods low conductance cuts and good seeds for local community methods

Post Info
More Details (n/a)

Added	19 Dec 2010
Updated	19 Dec 2010
Type	Journal
Year	2000
Where	JCT
Authors	Gábor N. Sárközy, Stanley M. Selkow

Comments (0)