{"@context":{"@vocab":"https://cir.nii.ac.jp/schema/1.0/","rdfs":"http://www.w3.org/2000/01/rdf-schema#","dc":"http://purl.org/dc/elements/1.1/","dcterms":"http://purl.org/dc/terms/","foaf":"http://xmlns.com/foaf/0.1/","prism":"http://prismstandard.org/namespaces/basic/2.0/","cinii":"http://ci.nii.ac.jp/ns/1.0/","datacite":"https://schema.datacite.org/meta/kernel-4/","ndl":"http://ndl.go.jp/dcndl/terms/","jpcoar":"https://github.com/JPCOAR/schema/blob/master/2.0/"},"@id":"https://cir.nii.ac.jp/crid/1360004232126199936.json","@type":"Article","productIdentifier":[{"identifier":{"@type":"DOI","@value":"10.1016/j.endm.2011.09.059"}},{"identifier":{"@type":"URI","@value":"https://api.elsevier.com/content/article/PII:S1571065311001284?httpAccept=text/xml"}},{"identifier":{"@type":"URI","@value":"https://api.elsevier.com/content/article/PII:S1571065311001284?httpAccept=text/plain"}}],"resourceType":"学術雑誌論文(journal article)","dc:title":[{"@value":"Rainbow k-connection in Dense Graphs (Extended Abstract)"}],"creator":[{"@id":"https://cir.nii.ac.jp/crid/1420845751141872512","@type":"Researcher","personIdentifier":[{"@type":"KAKEN_RESEARCHERS","@value":"60424206"},{"@type":"NRID","@value":"1000060424206"},{"@type":"NRID","@value":"9000006646769"},{"@type":"NRID","@value":"9000005791303"},{"@type":"NRID","@value":"9000006248962"},{"@type":"NRID","@value":"9000304623295"},{"@type":"NRID","@value":"9000415352229"},{"@type":"RESEARCHMAP","@value":"https://researchmap.jp/shinyafujitaphd"}],"foaf:name":[{"@value":"Shinya Fujita"}]},{"@id":"https://cir.nii.ac.jp/crid/1380004232126199938","@type":"Researcher","foaf:name":[{"@value":"Henry Liu"}]},{"@id":"https://cir.nii.ac.jp/crid/1380004232126199937","@type":"Researcher","foaf:name":[{"@value":"Colton Magnant"}]}],"publication":{"publicationIdentifier":[{"@type":"PISSN","@value":"15710653"}],"prism:publicationName":[{"@value":"Electronic Notes in Discrete Mathematics"}],"dc:publisher":[{"@value":"Elsevier BV"}],"prism:publicationDate":"2011-12","prism:volume":"38","prism:startingPage":"361","prism:endingPage":"366"},"reviewed":"false","dc:rights":["https://www.elsevier.com/tdm/userlicense/1.0/"],"url":[{"@id":"https://api.elsevier.com/content/article/PII:S1571065311001284?httpAccept=text/xml"},{"@id":"https://api.elsevier.com/content/article/PII:S1571065311001284?httpAccept=text/plain"}],"createdAt":"2011-12-09","modifiedAt":"2024-04-15","project":[{"@id":"https://cir.nii.ac.jp/crid/1040282257158795392","@type":"Project","projectIdentifier":[{"@type":"KAKEN","@value":"23740095"},{"@type":"JGN","@value":"JP23740095"},{"@type":"URI","@value":"https://kaken.nii.ac.jp/grant/KAKENHI-PROJECT-23740095/"}],"notation":[{"@language":"ja","@value":"グラフの閉路分割に関するラムゼー型問題の研究"},{"@language":"en","@value":"A study on Ramsey-type problem concerning cycle partitions in graphs"}]}],"relatedProduct":[{"@id":"https://cir.nii.ac.jp/crid/1360018681066284544","@type":"Article","relationType":["references"],"jpcoar:relatedTitle":[{"@value":"The rainbow connection of a graph is (at most) reciprocal to its minimum degree"}]},{"@id":"https://cir.nii.ac.jp/crid/1360574095535809152","@type":"Article","relationType":["references"],"jpcoar:relatedTitle":[{"@value":"The rainbow connectivity of a graph"}]},{"@id":"https://cir.nii.ac.jp/crid/1361137044514002560","@type":"Article","relationType":["references"],"jpcoar:relatedTitle":[{"@value":"On Rainbow Connection"}]},{"@id":"https://cir.nii.ac.jp/crid/1361699994944336896","@type":"Article","relationType":["references"],"jpcoar:relatedTitle":[{"@value":"Rainbow connection in graphs"}]},{"@id":"https://cir.nii.ac.jp/crid/1364233269708850176","@type":"Article","relationType":["references"],"jpcoar:relatedTitle":[{"@value":"Threshold functions"}]},{"@id":"https://cir.nii.ac.jp/crid/1371977244106760834","@type":"Product","relationType":["references"],"jpcoar:relatedTitle":[{"@value":"Rainbow trees in graphs and generalized connectivity"}]}],"dataSourceIdentifier":[{"@type":"CROSSREF","@value":"10.1016/j.endm.2011.09.059"},{"@type":"KAKEN","@value":"PRODUCT-14360899"}]}