Detailed Information

Cited 0 time in webofscience Cited 0 time in scopus
Metadata Downloads

Edge properties of the 4-valent multi 3-gon graphs

Full metadata record
DC FieldValueLanguage
dc.contributor.authorDalyoung Jeong-
dc.contributor.authorYong-Hyeon Han-
dc.date.available2021-02-22T11:25:42Z-
dc.date.issued2004-07-
dc.identifier.issn1225-1763-
dc.identifier.issn2234-3024-
dc.identifier.urihttps://scholarworks.sookmyung.ac.kr/handle/2020.sw.sookmyung/9597-
dc.description.abstractIn a 4-valent multi 3-gon graph, every cut-through curve forms a simple closed circuit. Hence it is a weak arrange- ment of simple curves that is de¯ned by Branko GrÄunbaum. In this paper, we study the edge properties of the 4-valent multi 3-gon graphs from the point of view of arrangement, and we show that they are 3 colorable.-
dc.format.extent8-
dc.language한국어-
dc.language.isoKOR-
dc.publisher대한수학회-
dc.titleEdge properties of the 4-valent multi 3-gon graphs-
dc.title.alternativeEdge properties of the 4-valent multi 3-gon graphs-
dc.typeArticle-
dc.publisher.location대한민국-
dc.identifier.bibliographicCitation대한수학회논문집, v.19, no.3, pp 577 - 584-
dc.citation.title대한수학회논문집-
dc.citation.volume19-
dc.citation.number3-
dc.citation.startPage577-
dc.citation.endPage584-
dc.identifier.kciidART000928224-
dc.description.isOpenAccessN-
dc.description.journalRegisteredClasskci-
dc.subject.keywordAuthorarrangement of curves-
dc.subject.keywordAuthormulti 3-gon graphs-
dc.subject.keywordAuthorvertex coloring.-
dc.identifier.urlhttps://www.kci.go.kr/kciportal/ci/sereArticleSearch/ciSereArtiView.kci?sereArticleSearchBean.artiId=ART000928224-
Files in This Item
Go to Link
Appears in
Collections
이과대학 > 수학과 > 1. Journal Articles

qrcode

Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.

Altmetrics

Total Views & Downloads

BROWSE