Generalizating path and fan graphs: subcoloring and toughness

Detalhes bibliográficos
Autor(a) principal: Markenzon,Lilian
Data de Publicação: 2014
Outros Autores: Waga,Christina F.E.M.
Tipo de documento: Artigo
Idioma: eng
Título da fonte: Pesquisa operacional (Online)
Texto Completo: http://old.scielo.br/scielo.php?script=sci_arttext&pid=S0101-74382014000100008
Resumo: Two graph classes are presented; the first one (k-ribbon) generalizes the path graph and the second one (k-fan) generalizes the fan graph. We prove that they are subclasses of chordal graphs and so they share the same structural properties of this class. The solution of two problems are presented: the determination of the subchromatic number and the determination of the toughness. It is shown that the elements of the new classes establish bounds for the toughness of k-path graphs.
id SOBRAPO-1_d372838883bcf9a4cb6fb8f58f6d2b0f
oai_identifier_str oai:scielo:S0101-74382014000100008
network_acronym_str SOBRAPO-1
network_name_str Pesquisa operacional (Online)
repository_id_str
spelling Generalizating path and fan graphs: subcoloring and toughnessk-path graphsk-ribbon graphsk-fan graphssubcoloringtoughnessTwo graph classes are presented; the first one (k-ribbon) generalizes the path graph and the second one (k-fan) generalizes the fan graph. We prove that they are subclasses of chordal graphs and so they share the same structural properties of this class. The solution of two problems are presented: the determination of the subchromatic number and the determination of the toughness. It is shown that the elements of the new classes establish bounds for the toughness of k-path graphs.Sociedade Brasileira de Pesquisa Operacional2014-04-01info:eu-repo/semantics/articleinfo:eu-repo/semantics/publishedVersiontext/htmlhttp://old.scielo.br/scielo.php?script=sci_arttext&pid=S0101-74382014000100008Pesquisa Operacional v.34 n.1 2014reponame:Pesquisa operacional (Online)instname:Sociedade Brasileira de Pesquisa Operacional (SOBRAPO)instacron:SOBRAPO10.1590/S0101-74382014005000004info:eu-repo/semantics/openAccessMarkenzon,LilianWaga,Christina F.E.M.eng2014-05-08T00:00:00Zoai:scielo:S0101-74382014000100008Revistahttp://www.scielo.br/popehttps://old.scielo.br/oai/scielo-oai.php||sobrapo@sobrapo.org.br1678-51420101-7438opendoar:2014-05-08T00:00Pesquisa operacional (Online) - Sociedade Brasileira de Pesquisa Operacional (SOBRAPO)false
dc.title.none.fl_str_mv Generalizating path and fan graphs: subcoloring and toughness
title Generalizating path and fan graphs: subcoloring and toughness
spellingShingle Generalizating path and fan graphs: subcoloring and toughness
Markenzon,Lilian
k-path graphs
k-ribbon graphs
k-fan graphs
subcoloring
toughness
title_short Generalizating path and fan graphs: subcoloring and toughness
title_full Generalizating path and fan graphs: subcoloring and toughness
title_fullStr Generalizating path and fan graphs: subcoloring and toughness
title_full_unstemmed Generalizating path and fan graphs: subcoloring and toughness
title_sort Generalizating path and fan graphs: subcoloring and toughness
author Markenzon,Lilian
author_facet Markenzon,Lilian
Waga,Christina F.E.M.
author_role author
author2 Waga,Christina F.E.M.
author2_role author
dc.contributor.author.fl_str_mv Markenzon,Lilian
Waga,Christina F.E.M.
dc.subject.por.fl_str_mv k-path graphs
k-ribbon graphs
k-fan graphs
subcoloring
toughness
topic k-path graphs
k-ribbon graphs
k-fan graphs
subcoloring
toughness
description Two graph classes are presented; the first one (k-ribbon) generalizes the path graph and the second one (k-fan) generalizes the fan graph. We prove that they are subclasses of chordal graphs and so they share the same structural properties of this class. The solution of two problems are presented: the determination of the subchromatic number and the determination of the toughness. It is shown that the elements of the new classes establish bounds for the toughness of k-path graphs.
publishDate 2014
dc.date.none.fl_str_mv 2014-04-01
dc.type.driver.fl_str_mv info:eu-repo/semantics/article
dc.type.status.fl_str_mv info:eu-repo/semantics/publishedVersion
format article
status_str publishedVersion
dc.identifier.uri.fl_str_mv http://old.scielo.br/scielo.php?script=sci_arttext&pid=S0101-74382014000100008
url http://old.scielo.br/scielo.php?script=sci_arttext&pid=S0101-74382014000100008
dc.language.iso.fl_str_mv eng
language eng
dc.relation.none.fl_str_mv 10.1590/S0101-74382014005000004
dc.rights.driver.fl_str_mv info:eu-repo/semantics/openAccess
eu_rights_str_mv openAccess
dc.format.none.fl_str_mv text/html
dc.publisher.none.fl_str_mv Sociedade Brasileira de Pesquisa Operacional
publisher.none.fl_str_mv Sociedade Brasileira de Pesquisa Operacional
dc.source.none.fl_str_mv Pesquisa Operacional v.34 n.1 2014
reponame:Pesquisa operacional (Online)
instname:Sociedade Brasileira de Pesquisa Operacional (SOBRAPO)
instacron:SOBRAPO
instname_str Sociedade Brasileira de Pesquisa Operacional (SOBRAPO)
instacron_str SOBRAPO
institution SOBRAPO
reponame_str Pesquisa operacional (Online)
collection Pesquisa operacional (Online)
repository.name.fl_str_mv Pesquisa operacional (Online) - Sociedade Brasileira de Pesquisa Operacional (SOBRAPO)
repository.mail.fl_str_mv ||sobrapo@sobrapo.org.br
_version_ 1750318017774878720

Registros relacionados