V. G. Vizing. On an estimate of the chromatic class of a p-graph. Metody Diskret. Analiz., 3:25--30, 1964. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
First 50 documents Next 50
Algorithms for Data Migration with Cloning - Khuller, Kim, Wan (2003) (1 citation) (Correct)
....all data is only sent to disks that desire it. Our algorithms make use of known results on edge coloring of multi graphs. Given a graph G with max degree G and multiplicity the following results are known (see [5] for example) Let be the edge chromatic number of G. Theorem 2.1. Vizing [27]) If G has no self loops G . Theorem 2.2. Shannon [23] If G has no selfloops b 2 G c. 3 The Data Migration Algorithm De ne j as jfijj 2 D i gj, i.e. the number of di erent sets D i , that a disk j belongs to. We then de ne as max j=1: N j . In other words, is an ....
V. G. Vizing. On an estimate of the chromatic class of a p-graph (Russian). Diskret. Analiz. 3:25{ 30, 1964. 10
Algorithms for the Total Colorings of Graphs - Isobe (1993) (2 citations) (Correct)
....c 3 . It is clear that any graph G needs at least Delta(G) colors for its edge coloring because edges incident to a vertex of degree Delta(G) must receive different colors. On the other hand, Vizing has proved in 1964 that any simple graph G has an edge coloring with at most Delta(G) 1 colors [Viz64]. His proof depends on two classical techniques called a fan sequence and an alternating path, and it immediately yields a polynomial time algorithm to find an edge coloring with at most Delta(G) 1 colors. It is known that the edge coloring problem, which asks to find an edge coloring of ....
....of all edges having color c is called the edge color class of c. By the definition of an edge coloring, clearly any edge color class is a matching. The following theorem is obtained by Vizing, which means that any graph G can be edge colored with Delta(G) or Delta(G) 1 colors. Theorem 2. 1 ([Viz64]) Any graph G satisfies Delta(G) G) Delta(G) 1. A total coloring of G is a mapping f : V [ E C satisfying the following three conditions (a) c) a) f(u) 6= f(v)forany two adjacent vertices u# v 2 V # (b) f(e) 6= f(e ) for any two adjacent edges e# e 2 E# and 15 (c) f(v) 6= ....
[Article contains additional citation context not shown here]
V. G. Vizing, On an estimate of the chromatic class of a p-graph. Discret. Analiz., 3, pp. 25--30, 1964.
The Circular Chromatic Index - Andrea Hackmann And (Correct)
.... (k; d) edge colorings with k q and gcd(k; d) 1 to determine c (G) Since the set fk=d : G has a (k; d) edge coloring with gcd(k; d) 1 and k qg is nite the in mum in the de nition of the circular chromatic index of G can be replaced by the minimum.2 Recall that by Vizing s theorem [4] (G) G) or (G) G) 1 for the chromatic index of an arbitrary graph G and that graphs with (G) G) are called class 1 and with (G) G) 1 class 2, respectively. From the de nition of the circular chromatic index it follows that c (G) G) We prove equality ....
V. G. Vizing, On an estimate of the chromatic class of a p-graph (in Russian). Metody Diskret. Anal. 3 (1964), 25-30.
Star Coloring of Graphs - Fertin, Raspaud, Reed (2001) (10 citations) (Correct)
....3 distinct colors by C. Hence, no path of length 2 in G can be bicolored ; consequently, no path of length 3 is bicolored either, and C is a star coloring of G. 2 It is a well known result that any graph of maximum degree d can be properly colored with at most d 1 colors (cf. for instance [Viz64]) Since G is of maximum degree d when G is of maximum degree d, we deduce the following corollary. Corollary 3 Let G be a graph of order n and of maximum degree d. Then s (G) d 1. Now we turn to the case where d = 3, that is cubic graphs. By Corollary 3 above, we deduce that for ....
V.G. Vizing. On an estimate of the chromatic class of a p-graph. Diskrete Analiz., 3:25-30, 1964. In Russian. 17
Exponential Algorithmic Speedup by a Quantum Walk - Andrew Childs Richard (Correct)
No context found.
V. G. Vizing. On an estimate of the chromatic class of a p-graph. Metody Diskret. Analiz., 3:25--30, 1964.
Improved Bounds on Acyclic Edge Colouring - Rahul Muthu Narayanan (Correct)
No context found.
Vizing V G, On an estimate of the chromatic class of a p-graph, Metody Diskret. Analys (1964) 25-30.
Fiber Cost Reduction and Wavelength Minimization in .. - Nomikos.. (2003) (Correct)
No context found.
V. Vizing. On an estimate of the chromatic class of a p-graph (in russian). Diskret. Analiz., 3:23--30, 1964.
Very Fast Parallel Algorithms for Approximate Edge Coloring - Han, Liang, Shen (Correct)
No context found.
V. G. Vizing. On an estimate of the chromatic class of a p-graph. Diskret. Anal. 3 (1964), 25-30. (in Russian). 12
Switch Scheduling via Randomized Edge Coloring - Rajeev (Correct)
No context found.
V.G. Vizing. On an Estimate of the Chromatic Class of a p-graph. Metody Diskret. Analiz. 3 (1964), pages 25-30.
An Asymptotic Approximation Scheme for Multigraph Edge Coloring - Peter Sanders David (Correct)
No context found.
V. G. Vizing. On an estimate of the chromatic class of a p-graph (in russian). Diskret. Analiz,
On the Benefit of Tunability in Reducing Electronic Port.. - Berry, Modiano (2004) (Correct)
No context found.
V. G. Vizing, "On an estimate of the chromatic class of a p-graph," Diskret. Analiz 3(1964),25-30.
On Generalized Gossiping and Broadcasting (Extended Abstract) - Khuller, Kim, Wan (Correct)
No context found.
V. G. Vizing. On an estimate of the chromatic class of a p-graph (Russian). Diskret. Analiz. 3:25--30, 1964.
Acyclic, Star and Oriented Colourings of Graph Subdivisions - Wood (Correct)
No context found.
V. G. Vizing, On an estimate of the chromatic class of a p-graph. Diskret. Analiz No., 3:25-30, 1964.
Algorithms for Data Migration with Cloning - Khuller, Kim, Wan (2003) (1 citation) (Correct)
No context found.
V. G. Vizing. On an estimate of the chromatic class of a p-graph (Russian). Diskret. Analiz. 3:25--30, 1964.
The Primal-Dual Method for Approximation Algorithms - Williamson (4 citations) (Correct)
No context found.
V. G. Vizing. On an estimate of the chromatic class of a p-graph (in Russian). Diskret. Analiz., 3:23--30, 1964.
Stacks, Queues and Tracks: Layouts of Graph Subdivisions - Dujmovic, Wood (2004) (Correct)
No context found.
V. G. VIZING, On an estimate of the chromatic class of a p-graph. Diskret. Analiz No., 3:25--30, 1964.
Colouring the Petals of a Graph - David Cariolaro Department (Correct)
No context found.
V.G. Vizing, On an estimate of the chromatic class of a p-graph, (in Russian), Diskret. Analiz., 3 (1964), 25-30.
Vertex Colouring and Forbidden Subgraphs - a Survey - Randerath, Schiermeyer (2003) (Correct)
No context found.
V. G. Vizing, On an estimate of the chromatic class of a p-graph, Diskret. Analiz. 3 (1964), 25-30, [Russian].
D; 1)-Total - Labelling Of Connected (Correct)
No context found.
V. G. Vizing. On the estimate of the chromatic class of a p-graphs (in Russian). Metody Diskret. Analiz., 3 :25--30, 1964.
Colouring the Petals of a Graph - Cariolaro, Cariolaro (2003) (Correct)
No context found.
V.G. Vizing, On an estimate of the chromatic class of a p-graph, (in Russian), Diskret. Analiz., 3 (1964), 25-30.
On the Benefit of Tunability in Reducing Electronic Port.. - Berry, Modiano (2004) (Correct)
No context found.
V. G. Vizing, "On an estimate of the chromatic class of a p-graph," Diskret. Analiz 3(1964),25-30.
A Revival of the Girth Conjecture - Tom Kaiser Daniel (2003) (Correct)
No context found.
V. G. Vizing, On an estimate of the chromatic class of a p-graph (in Russian), Diskret. Analiz. 3 (1964), 24-30.
Edge Colorings And Total Colorings Of Integer Distance Graphs - Kemnitz, Marangio (2000) (Correct)
No context found.
Vadim G. Vizing, On an estimate of the chromatic class of a p-graph, Metody Diskret. Analiz. 3 (1964), 2530 (russian).
Circular Total Colorings Of Graphs - Andrea Hackmann And (Correct)
No context found.
V. G. Vizing, On an estimate of the chromatic class of a p-graph (Russian). Diskret. Analiz 3 (1964), 25-30.
Exponential Algorithmic Speedup by a Quantum Walk - Childs, Cleve, Deotto.. (2 citations) (Correct)
No context found.
V. G. Vizing. On an estimate of the chromatic class of a p-graph. Metody Diskret. Analiz., 3:25--30, 1964.
First 50 documents Next 50
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC