Immersion Containment and Connectivity in Color-Critical Graphs

Abu-Khzam, Faisal N.; Langston, Micheal

dc.contributor.author	Abu-Khzam, Faisal N.
dc.contributor.author	Langston, Micheal
dc.date.accessioned	2015-12-07T10:27:10Z
dc.date.available	2015-12-07T10:27:10Z
dc.date.copyright	2012
dc.date.issued	2015-12-07
dc.identifier.issn	1462-7264	en_US
dc.identifier.uri	http://hdl.handle.net/10725/2774
dc.description.abstract	The relationship between graph coloring and the immersion order is considered. Vertex connectivity, edge connectivity and related issues are explored. It is shown that a t-chromatic graph G contains either an immersed Kt or an immersed t-chromatic subgraph that is both 4-vertex-connected and t-edge-connected. This gives supporting evidence of our conjecture that if G requires at least t colors, then Kt is immersed in G.	en_US
dc.language.iso	en	en_US
dc.title	Immersion Containment and Connectivity in Color-Critical Graphs	en_US
dc.type	Article	en_US
dc.description.version	Published	en_US
dc.author.school	SAS	en_US
dc.author.idnumber	200302941	en_US
dc.author.woa	N/A	en_US
dc.author.department	Computer Science and Mathematics	en_US
dc.description.embargo	N/A	en_US
dc.relation.journal	Discrete Mathematics and Theoretical Computer Science	en_US
dc.journal.volume	14	en_US
dc.journal.issue	2	en_US
dc.article.pages	155-164	en_US
dc.keywords	Immersion order	en_US
dc.keywords	Graph coloring	en_US
dc.keywords	Color-critical graphs	en_US
dc.identifier.ctation	Langston, M. A., & Abu-Khzam, F. N. (2012). Immersion containment and connectivity in color-critical graphs. Discrete Mathematics & Theoretical Computer Science, 14.	en_US
dc.author.email	faisal.abukhzam@lau.edu.lb
dc.identifier.url	http://dmtcs.episciences.org/589
dc.orcid.id	https://orcid.org/0000-0001-5221-8421