Edge coloring - Revision history

en>David Eppstein: /* Algorithms that use more than the optimal number of colors */ see Misra & Gries edge coloring algorithm

2014-11-25T02:19:58Z

Algorithms that use more than the optimal number of colors: see Misra & Gries edge coloring algorithm

← Older revision		Revision as of 04:19, 25 November 2014
Line 1:		Line 1:
	~~[[File:Exact coloring~~.~~svg\|thumb\|right\|Example of Exact Coloring with 7 colors~~ and ~~14 vertices]]~~		Nice to meet you, I am Marvella Shryock. Puerto Rico is where he's been living for many years and he will by no means move. To gather cash is 1 of the issues I love most. Bookkeeping is her working day occupation now.<br><br>Look into my web blog ... [http://www.myprgenie.com/view-publication/how-to-be-successful-with-your-weight-loss-goals weight loss food delivery]
	~~In [[graph theory]], an '''exact coloring''' is a [[Graph coloring\|(proper) vertex coloring]] in which every pair of colors appears on exactly one pair of adjacent vertices~~.
	~~That~~ is~~, it is a [[Partition of a set\|partition]]~~ of the ~~vertices of the graph into disjoint [[independent set (graph theory)\|independent sets]] such that, for each pair of distinct independent sets in the partition, there~~ is ~~exactly one edge with endpoints in each set~~.<~~ref name="e05"~~>~~{{citation~~
	~~\| last = Edwards \| first = Keith~~
	~~\| doi = 10.1017/S0963548304006558~~
	~~\| issue = 3~~
	~~\| journal = Combinatorics, Probability and Computing~~
	~~\| mr = 2138114~~
	~~\| pages = 275–310~~
	~~\| title = Detachments of complete graphs~~
	~~\| volume = 14~~
	~~\| year = 2005}}.~~<~~/ref~~>~~<ref name="e10">{{citation~~
	~~\| last = Edwards \| first = Keith~~
	~~\| doi = 10~~.~~1002/jgt~~.~~20468~~
	~~\| issue = 2~~
	~~\| journal = Journal of Graph Theory~~
	~~\| mr = 2724490~~
	~~\| pages = 94–114~~
	~~\| title = Achromatic number of fragmentable graphs~~
	~~\| volume = 65~~
	~~\| year = 2010}}~~.~~</ref>~~

	~~==Complete graphs, detachments, and Euler tours==~~
	[~~[Image~~:~~Graph_exact_coloring.gif\|thumb\|Exact coloring of the [[complete graph]] ''K''<sub>6<~~/~~sub>]]~~
	~~Every ''n''-vertex [[complete graph]] ''K''<sub>''n''<~~/~~sub> has an exact coloring with ''n'' colors, obtained by giving each vertex a distinct color~~.
	Every graph with an ''n''-color exact coloring may be obtained as a ''detachment'' of a complete graph, a graph obtained from the complete graph by splitting each vertex into an independent set and reconnecting each edge incident to the vertex to exactly one of the members of the corresponding independent set.~~<ref name="e05"~~/~~><ref name="e10"/>~~

	~~When ''k'' is an [[odd number]], A path or cycle with <math>\tbinom{k}{2}</math> edges has an exact coloring, obtained by forming an exact coloring of the complete graph ''K''<sub>''k''<~~/~~sub> and then finding an [[Euler tour]] of this complete graph. For instance, a path with three edges has a complete 3~~-~~coloring.<ref name="e10"/>~~

	~~==Related types of coloring==~~
	~~Exact colorings are closely related~~ to [[harmonious coloring]]s (colorings in which each pair of colors appears at most once) and [[complete coloring]]s (colorings in which each pair of colors appears at least once). Clearly, an exact coloring is a coloring that is both harmonious and complete. A graph ''G'' with ''n'' vertices and ''m'' edges has a harmonious ''k''-~~coloring if and only if <math>m\le\tbinom{k}{2}</math> and the graph formed from ''G'' by adding <math>\tbinom{k}{2}~~-~~m</math> isolated edges has an exact coloring. A graph ''G'' with the same parameters has a complete ''k''~~-~~coloring if and only if <math>m\ge\tbinom{k}{2}</math> and there exists a subgraph ''H'' of ''G''~~ with ~~an exact ''k''~~-coloring in which each edge of ''G'' − ''H'' has endpoints of different colorings. The need for the condition on the edges of ''G'' − ''H'' is shown by the example of a four-vertex cycle, which has a subgraph with an exact 3-~~coloring (the three~~-~~edge path) but does not have a complete 3-coloring itself.<ref name="e10"/>~~

	~~==Computational complexity==~~
	~~It is [[NP~~-~~complete]] to determine whether a given graph has an exact coloring, even in the case that the graph is a [[tree (graph theory)\|tree]].<ref name="e05"/><ref>{{citation~~
	~~\| last1 = Edwards \| first1 = Keith~~
	~~\| last2 = McDiarmid \| first2 = Colin~~
	~~\| doi = 10.1016/0166-218X(94)00100-R~~
	~~\| issue = 2-3~~
	~~\| journal = Discrete Applied Mathematics~~
	~~\| mr = 1327772~~
	~~\| pages = 133–144~~
	~~\| title = The complexity of harmonious colouring for trees~~
	~~\| volume = 57~~
	~~\| year = 1995}}.</ref> However, the problem may be solved in [[polynomial time]] for trees of bounded [[degree (graph theory)\|degree]].<ref name="e05"/><ref>{{citation~~
	~~\| last = Edwards \| first = Keith~~
	~~\| doi = 10.1017/S0963548300001802~~
	~~\| issue = 1~~
	~~\| journal = Combinatorics, Probability and Computing~~
	~~\| mr = 1395690~~
	~~\| pages = 15–28~~
	~~\| title = The harmonious chromatic number of bounded degree trees~~
	~~\| volume = 5~~
	~~\| year = 1996}}.</ref>~~

	~~==References==~~
	~~{{reflist}}~~

	~~[[Category:Graph coloring]~~]

en>Atethnekos: fix cs1 error

2013-12-03T05:02:25Z

fix cs1 error

← Older revision		Revision as of 07:02, 3 December 2013
Line 1:		Line 1:
	~~Adrianne Swoboda~~ is ~~what~~ it [~~http:~~//~~Www~~.~~Alexa~~.~~com~~/~~search?q~~=~~husband&r~~=~~topsites_index&p~~=~~bigtop husband~~] ~~loves to make her though she doesn~~'~~t always really like being medically known~~ as ~~like that~~. ~~Software achieving~~ is ~~what she conducts but she~~'~~s always ideal her own business~~. ~~To drive is something that~~ a ~~majority~~ of ~~she'~~s ~~been doing for years~~. ~~Idaho~~ is ~~where her home~~ is ~~generally~~ and ~~she will never move~~. ~~Go to her website to pick out more: http:~~//~~prometeu~~.~~net~~<br><br>~~Stop~~ by ~~my blog ::~~ [~~http:~~//~~prometeu~~.~~net clash~~ of ~~clans gold glitch~~]		[[File:Exact coloring.svg\|thumb\|right\|Example of Exact Coloring with 7 colors and 14 vertices]]
			In [[graph theory]], an '''exact coloring''' is a [[Graph coloring\|(proper) vertex coloring]] in which every pair of colors appears on exactly one pair of adjacent vertices.
			That is, it is a [[Partition of a set\|partition]] of the vertices of the graph into disjoint [[independent set (graph theory)\|independent sets]] such that, for each pair of distinct independent sets in the partition, there is exactly one edge with endpoints in each set.<ref name="e05">{{citation
			\| last = Edwards \| first = Keith
			\| doi = 10.1017/S0963548304006558
			\| issue = 3
			\| journal = Combinatorics, Probability and Computing
			\| mr = 2138114
			\| pages = 275–310
			\| title = Detachments of complete graphs
			\| volume = 14
			\| year = 2005}}.</ref><ref name="e10">{{citation
			\| last = Edwards \| first = Keith
			\| doi = 10.1002/jgt.20468
			\| issue = 2
			\| journal = Journal of Graph Theory
			\| mr = 2724490
			\| pages = 94–114
			\| title = Achromatic number of fragmentable graphs
			\| volume = 65
			\| year = 2010}}.</ref>

			==Complete graphs, detachments, and Euler tours==
			[[Image:Graph_exact_coloring.gif\|thumb\|Exact coloring of the [[complete graph]] ''K''<sub>6</sub>]]
			Every ''n''-vertex [[complete graph]] ''K''<sub>''n''</sub> has an exact coloring with ''n'' colors, obtained by giving each vertex a distinct color.
			Every graph with an ''n''-color exact coloring may be obtained as a ''detachment'' of a complete graph, a graph obtained from the complete graph by splitting each vertex into an independent set and reconnecting each edge incident to the vertex to exactly one of the members of the corresponding independent set.<ref name="e05"/><ref name="e10"/>

			When ''k'' is an [[odd number]], A path or cycle with <math>\tbinom{k}{2}</math> edges has an exact coloring, obtained by forming an exact coloring of the complete graph ''K''<sub>''k''</sub> and then finding an [[Euler tour]] of this complete graph. For instance, a path with three edges has a complete 3-coloring.<ref name="e10"/>

			==Related types of coloring==
			Exact colorings are closely related to [[harmonious coloring]]s (colorings in which each pair of colors appears at most once) and [[complete coloring]]s (colorings in which each pair of colors appears at least once). Clearly, an exact coloring is a coloring that is both harmonious and complete. A graph ''G'' with ''n'' vertices and ''m'' edges has a harmonious ''k''-coloring if and only if <math>m\le\tbinom{k}{2}</math> and the graph formed from ''G'' by adding <math>\tbinom{k}{2}-m</math> isolated edges has an exact coloring. A graph ''G'' with the same parameters has a complete ''k''-coloring if and only if <math>m\ge\tbinom{k}{2}</math> and there exists a subgraph ''H'' of ''G'' with an exact ''k''-coloring in which each edge of ''G'' − ''H'' has endpoints of different colorings. The need for the condition on the edges of ''G'' − ''H'' is shown by the example of a four-vertex cycle, which has a subgraph with an exact 3-coloring (the three-edge path) but does not have a complete 3-coloring itself.<ref name="e10"/>

			==Computational complexity==
			It is [[NP-complete]] to determine whether a given graph has an exact coloring, even in the case that the graph is a [[tree (graph theory)\|tree]].<ref name="e05"/><ref>{{citation
			\| last1 = Edwards \| first1 = Keith
			\| last2 = McDiarmid \| first2 = Colin
			\| doi = 10.1016/0166-218X(94)00100-R
			\| issue = 2-3
			\| journal = Discrete Applied Mathematics
			\| mr = 1327772
			\| pages = 133–144
			\| title = The complexity of harmonious colouring for trees
			\| volume = 57
			\| year = 1995}}.</ref> However, the problem may be solved in [[polynomial time]] for trees of bounded [[degree (graph theory)\|degree]].<ref name="e05"/><ref>{{citation
			\| last = Edwards \| first = Keith
			\| doi = 10.1017/S0963548300001802
			\| issue = 1
			\| journal = Combinatorics, Probability and Computing
			\| mr = 1395690
			\| pages = 15–28
			\| title = The harmonious chromatic number of bounded degree trees
			\| volume = 5
			\| year = 1996}}.</ref>

			==References==
			{{reflist}}

			[[Category:Graph coloring]]

en>Giftlite: /* Vizing's theorem */ −.

2012-08-09T17:02:02Z

Vizing's theorem: −.

New page

Adrianne Swoboda is what it [http://Www.Alexa.com/search?q=husband&r=topsites_index&p=bigtop husband] loves to make her though she doesn't always really like being medically known as like that. Software achieving is what she conducts but she's always ideal her own business. To drive is something that a majority of she's been doing for years. Idaho is where her home is generally and she will never move. Go to her website to pick out more: http://prometeu.net<br><br>Stop by my blog :: [http://prometeu.net clash of clans gold glitch]

← Older revision		Revision as of 04:19, 25 November 2014
Line 1:		Line 1:
	~~[[File:Exact coloring~~.~~svg\|thumb\|right\|Example of Exact Coloring with 7 colors~~ and ~~14 vertices]]~~		Nice to meet you, I am Marvella Shryock. Puerto Rico is where he's been living for many years and he will by no means move. To gather cash is 1 of the issues I love most. Bookkeeping is her working day occupation now.<br><br>Look into my web blog ... [http://www.myprgenie.com/view-publication/how-to-be-successful-with-your-weight-loss-goals weight loss food delivery]
	~~In [[graph theory]], an '''exact coloring''' is a [[Graph coloring\|(proper) vertex coloring]] in which every pair of colors appears on exactly one pair of adjacent vertices~~.
	~~That~~ is~~, it is a [[Partition of a set\|partition]]~~ of the ~~vertices of the graph into disjoint [[independent set (graph theory)\|independent sets]] such that, for each pair of distinct independent sets in the partition, there~~ is ~~exactly one edge with endpoints in each set~~.<~~ref name="e05"~~>~~{{citation~~
	~~\| last = Edwards \| first = Keith~~
	~~\| doi = 10.1017/S0963548304006558~~
	~~\| issue = 3~~
	~~\| journal = Combinatorics, Probability and Computing~~
	~~\| mr = 2138114~~
	~~\| pages = 275–310~~
	~~\| title = Detachments of complete graphs~~
	~~\| volume = 14~~
	~~\| year = 2005}}.~~<~~/ref~~>~~<ref name="e10">{{citation~~
	~~\| last = Edwards \| first = Keith~~
	~~\| doi = 10~~.~~1002/jgt~~.~~20468~~
	~~\| issue = 2~~
	~~\| journal = Journal of Graph Theory~~
	~~\| mr = 2724490~~
	~~\| pages = 94–114~~
	~~\| title = Achromatic number of fragmentable graphs~~
	~~\| volume = 65~~
	~~\| year = 2010}}~~.~~</ref>~~

	~~==Complete graphs, detachments, and Euler tours==~~
	[~~[Image~~:~~Graph_exact_coloring.gif\|thumb\|Exact coloring of the [[complete graph]] ''K''<sub>6<~~/~~sub>]]~~
	~~Every ''n''-vertex [[complete graph]] ''K''<sub>''n''<~~/~~sub> has an exact coloring with ''n'' colors, obtained by giving each vertex a distinct color~~.
	Every graph with an ''n''-color exact coloring may be obtained as a ''detachment'' of a complete graph, a graph obtained from the complete graph by splitting each vertex into an independent set and reconnecting each edge incident to the vertex to exactly one of the members of the corresponding independent set.~~<ref name="e05"~~/~~><ref name="e10"/>~~

	~~When ''k'' is an [[odd number]], A path or cycle with <math>\tbinom{k}{2}</math> edges has an exact coloring, obtained by forming an exact coloring of the complete graph ''K''<sub>''k''<~~/~~sub> and then finding an [[Euler tour]] of this complete graph. For instance, a path with three edges has a complete 3~~-~~coloring.<ref name="e10"/>~~

	~~==Related types of coloring==~~
	~~Exact colorings are closely related~~ to [[harmonious coloring]]s (colorings in which each pair of colors appears at most once) and [[complete coloring]]s (colorings in which each pair of colors appears at least once). Clearly, an exact coloring is a coloring that is both harmonious and complete. A graph ''G'' with ''n'' vertices and ''m'' edges has a harmonious ''k''-~~coloring if and only if <math>m\le\tbinom{k}{2}</math> and the graph formed from ''G'' by adding <math>\tbinom{k}{2}~~-~~m</math> isolated edges has an exact coloring. A graph ''G'' with the same parameters has a complete ''k''~~-~~coloring if and only if <math>m\ge\tbinom{k}{2}</math> and there exists a subgraph ''H'' of ''G''~~ with ~~an exact ''k''~~-coloring in which each edge of ''G'' − ''H'' has endpoints of different colorings. The need for the condition on the edges of ''G'' − ''H'' is shown by the example of a four-vertex cycle, which has a subgraph with an exact 3-~~coloring (the three~~-~~edge path) but does not have a complete 3-coloring itself.<ref name="e10"/>~~

	~~==Computational complexity==~~
	~~It is [[NP~~-~~complete]] to determine whether a given graph has an exact coloring, even in the case that the graph is a [[tree (graph theory)\|tree]].<ref name="e05"/><ref>{{citation~~
	~~\| last1 = Edwards \| first1 = Keith~~
	~~\| last2 = McDiarmid \| first2 = Colin~~
	~~\| doi = 10.1016/0166-218X(94)00100-R~~
	~~\| issue = 2-3~~
	~~\| journal = Discrete Applied Mathematics~~
	~~\| mr = 1327772~~
	~~\| pages = 133–144~~
	~~\| title = The complexity of harmonious colouring for trees~~
	~~\| volume = 57~~
	~~\| year = 1995}}.</ref> However, the problem may be solved in [[polynomial time]] for trees of bounded [[degree (graph theory)\|degree]].<ref name="e05"/><ref>{{citation~~
	~~\| last = Edwards \| first = Keith~~
	~~\| doi = 10.1017/S0963548300001802~~
	~~\| issue = 1~~
	~~\| journal = Combinatorics, Probability and Computing~~
	~~\| mr = 1395690~~
	~~\| pages = 15–28~~
	~~\| title = The harmonious chromatic number of bounded degree trees~~
	~~\| volume = 5~~
	~~\| year = 1996}}.</ref>~~

	~~==References==~~
	~~{{reflist}}~~

	~~[[Category:Graph coloring]~~]