This paper considers the question of whether or not a P5-free graph can be 4-colored in polynomial time. It is known that a connected P5-free graph G must have either a dominating clique or a dominating P3. Thus, when considering the 4-coloring question, we have three cases of interest: either G has a dominating K4, a dominating K3, or a dominating P3. In this paper, we demonstrate a polynomial time approach for determining whether or not a P5-free graph G with a dominating K4 can be 4-colored.
Les informations fournies dans la section « Synopsis » peuvent faire référence à une autre édition de ce titre.
This paper considers the question of whether or not a P5-free graph can be 4-colored in polynomial time. It is known that a connected P5-free graph G must have either a dominating clique or a dominating P3. Thus, when considering the 4-coloring question, we have three cases of interest: either G has a dominating K4, a dominating K3, or a dominating P3. In this paper, we demonstrate a polynomial time approach for determining whether or not a P5-free graph G with a dominating K4 can be 4-colored.
Currently, work for a financial institution as senior developer in Toronto, ON. Canada. From Jan.2003 to Jun.2005, major in Computing & Information Science at University of Guelph in Canada, received Master Degree. From Sept.1990 to Jul.1994, major in Computer Science at Civil Aviation Institute of China, received Bachelor Degree.
Les informations fournies dans la section « A propos du livre » peuvent faire référence à une autre édition de ce titre.
Vendeur : BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Allemagne
Taschenbuch. Etat : Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -This paper considers the question of whether or not a P5-free graph can be 4-colored in polynomial time. It is known that a connected P5-free graph G must have either a dominating clique or a dominating P3. Thus, when considering the 4-coloring question, we have three cases of interest: either G has a dominating K4, a dominating K3, or a dominating P3. In this paper, we demonstrate a polynomial time approach for determining whether or not a P5-free graph G with a dominating K4 can be 4-colored. 112 pp. Englisch. N° de réf. du vendeur 9783838373676
Quantité disponible : 2 disponible(s)
Vendeur : AHA-BUCH GmbH, Einbeck, Allemagne
Taschenbuch. Etat : Neu. nach der Bestellung gedruckt Neuware - Printed after ordering - This paper considers the question of whether or not a P5-free graph can be 4-colored in polynomial time. It is known that a connected P5-free graph G must have either a dominating clique or a dominating P3. Thus, when considering the 4-coloring question, we have three cases of interest: either G has a dominating K4, a dominating K3, or a dominating P3. In this paper, we demonstrate a polynomial time approach for determining whether or not a P5-free graph G with a dominating K4 can be 4-colored. N° de réf. du vendeur 9783838373676
Quantité disponible : 1 disponible(s)
Vendeur : moluna, Greven, Allemagne
Etat : New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. Autor/Autorin: wang zebinCurrently, work for a financial institution as senior developer in Toronto, ON. Canada. From Jan.2003 to Jun.2005, major in Computing & Information Science at University of Guelph in Canada, received Master Degree. From . N° de réf. du vendeur 5417671
Quantité disponible : Plus de 20 disponibles
Vendeur : buchversandmimpf2000, Emtmannsberg, BAYE, Allemagne
Taschenbuch. Etat : Neu. This item is printed on demand - Print on Demand Titel. Neuware -This paper considers the question of whether or not a P5-free graph can be 4-colored in polynomial time. It is known that a connected P5-free graph G must have either a dominating clique or a dominating P3. Thus, when considering the 4-coloring question, we have three cases of interest: either G has a dominating K4, a dominating K3, or a dominating P3. In this paper, we demonstrate a polynomial time approach for determining whether or not a P5-free graph G with a dominating K4 can be 4-colored.VDM Verlag, Dudweiler Landstraße 99, 66123 Saarbrücken 112 pp. Englisch. N° de réf. du vendeur 9783838373676
Quantité disponible : 1 disponible(s)
Vendeur : preigu, Osnabrück, Allemagne
Taschenbuch. Etat : Neu. Colorability of P5-free Graphs | 4-colorability belongs P for P5-free graphs with a dominating K4 | Zebin Wang | Taschenbuch | 112 S. | Englisch | 2010 | LAP LAMBERT Academic Publishing | EAN 9783838373676 | Verantwortliche Person für die EU: preigu GmbH & Co. KG, Lengericher Landstr. 19, 49078 Osnabrück, mail[at]preigu[dot]de | Anbieter: preigu. N° de réf. du vendeur 101042584
Quantité disponible : 5 disponible(s)
Vendeur : Mispah books, Redhill, SURRE, Royaume-Uni
paperback. Etat : Like New. LIKE NEW. SHIPS FROM MULTIPLE LOCATIONS. book. N° de réf. du vendeur ERICA80038383736776
Quantité disponible : 1 disponible(s)