An improved bound on 2-distance coloring plane graphs with girth 5 View Full Text


Ontology type: schema:ScholarlyArticle     


Article Info

DATE

2016-08

AUTHORS

Wei Dong, Wensong Lin

ABSTRACT

A vertex coloring is called 2-distance if any two vertices at distance at most 2 from each other get different colors. The minimum number of colors in 2-distance colorings of G is its 2-distance chromatic number, denoted by χ2(G). Let G be a plane graph with girth at least 5. In this paper, we prove that χ2(G)≤Δ+8 for arbitrary Δ(G), which partially improves some known results. More... »

PAGES

645-655

References to SciGraph publications

Identifiers

URI

http://scigraph.springernature.com/pub.10.1007/s10878-015-9888-4

DOI

http://dx.doi.org/10.1007/s10878-015-9888-4

DIMENSIONS

https://app.dimensions.ai/details/publication/pub.1029544188


Indexing Status Check whether this publication has been indexed by Scopus and Web Of Science using the SN Indexing Status Tool
Incoming Citations Browse incoming citations for this publication using opencitations.net

JSON-LD is the canonical representation for SciGraph data.

TIP: You can open this SciGraph record using an external JSON-LD service: JSON-LD Playground Google SDTT

[
  {
    "@context": "https://springernature.github.io/scigraph/jsonld/sgcontext.json", 
    "about": [
      {
        "id": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/0101", 
        "inDefinedTermSet": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/", 
        "name": "Pure Mathematics", 
        "type": "DefinedTerm"
      }, 
      {
        "id": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/01", 
        "inDefinedTermSet": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/", 
        "name": "Mathematical Sciences", 
        "type": "DefinedTerm"
      }
    ], 
    "author": [
      {
        "affiliation": {
          "alternateName": "Nanjing Xiaozhuang University", 
          "id": "https://www.grid.ac/institutes/grid.440845.9", 
          "name": [
            "Department of Mathematics, Southeast University, 211189, Nanjing, China", 
            "School of Mathematics and Information Technology, Nanjing Xiaozhuang University, 211171, Nanjing, China"
          ], 
          "type": "Organization"
        }, 
        "familyName": "Dong", 
        "givenName": "Wei", 
        "id": "sg:person.014055474150.78", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.014055474150.78"
        ], 
        "type": "Person"
      }, 
      {
        "affiliation": {
          "alternateName": "Southeast University", 
          "id": "https://www.grid.ac/institutes/grid.263826.b", 
          "name": [
            "Department of Mathematics, Southeast University, 211189, Nanjing, China"
          ], 
          "type": "Organization"
        }, 
        "familyName": "Lin", 
        "givenName": "Wensong", 
        "id": "sg:person.012212777401.48", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.012212777401.48"
        ], 
        "type": "Person"
      }
    ], 
    "citation": [
      {
        "id": "https://doi.org/10.1002/jgt.10077", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1001701992"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "https://doi.org/10.1016/j.jctb.2004.12.005", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1001705660"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "sg:pub.10.1007/s10878-013-9700-2", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1007996173", 
          "https://doi.org/10.1007/s10878-013-9700-2"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "sg:pub.10.1007/s10878-012-9507-6", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1008734638", 
          "https://doi.org/10.1007/s10878-012-9507-6"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "https://doi.org/10.1016/j.disc.2009.06.029", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1012808550"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "sg:pub.10.1007/s10878-011-9409-z", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1050611643", 
          "https://doi.org/10.1007/s10878-011-9409-z"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "https://doi.org/10.1016/j.ejc.2007.11.005", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1053537383"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "https://doi.org/10.1137/s0895480101390448", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1062882601"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "https://app.dimensions.ai/details/publication/pub.1109703686", 
        "type": "CreativeWork"
      }, 
      {
        "id": "sg:pub.10.1007/978-1-349-03521-2", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1109703686", 
          "https://doi.org/10.1007/978-1-349-03521-2"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "sg:pub.10.1007/978-1-349-03521-2", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1109703686", 
          "https://doi.org/10.1007/978-1-349-03521-2"
        ], 
        "type": "CreativeWork"
      }
    ], 
    "datePublished": "2016-08", 
    "datePublishedReg": "2016-08-01", 
    "description": "A vertex coloring is called 2-distance if any two vertices at distance at most 2 from each other get different colors. The minimum number of colors in 2-distance colorings of G is its 2-distance chromatic number, denoted by \u03c72(G). Let G be a plane graph with girth at least 5. In this paper, we prove that \u03c72(G)\u2264\u0394+8 for arbitrary \u0394(G), which partially improves some known results.", 
    "genre": "research_article", 
    "id": "sg:pub.10.1007/s10878-015-9888-4", 
    "inLanguage": [
      "en"
    ], 
    "isAccessibleForFree": false, 
    "isPartOf": [
      {
        "id": "sg:journal.1036683", 
        "issn": [
          "1382-6905", 
          "1573-2886"
        ], 
        "name": "Journal of Combinatorial Optimization", 
        "type": "Periodical"
      }, 
      {
        "issueNumber": "2", 
        "type": "PublicationIssue"
      }, 
      {
        "type": "PublicationVolume", 
        "volumeNumber": "32"
      }
    ], 
    "name": "An improved bound on 2-distance coloring plane graphs with girth 5", 
    "pagination": "645-655", 
    "productId": [
      {
        "name": "readcube_id", 
        "type": "PropertyValue", 
        "value": [
          "8cbeb43105afaebf99ee8fcdd853890bcf43881ba15520dd962c3e660e568875"
        ]
      }, 
      {
        "name": "doi", 
        "type": "PropertyValue", 
        "value": [
          "10.1007/s10878-015-9888-4"
        ]
      }, 
      {
        "name": "dimensions_id", 
        "type": "PropertyValue", 
        "value": [
          "pub.1029544188"
        ]
      }
    ], 
    "sameAs": [
      "https://doi.org/10.1007/s10878-015-9888-4", 
      "https://app.dimensions.ai/details/publication/pub.1029544188"
    ], 
    "sdDataset": "articles", 
    "sdDatePublished": "2019-04-10T14:21", 
    "sdLicense": "https://scigraph.springernature.com/explorer/license/", 
    "sdPublisher": {
      "name": "Springer Nature - SN SciGraph project", 
      "type": "Organization"
    }, 
    "sdSource": "s3://com-uberresearch-data-dimensions-target-20181106-alternative/cleanup/v134/2549eaecd7973599484d7c17b260dba0a4ecb94b/merge/v9/a6c9fde33151104705d4d7ff012ea9563521a3ce/jats-lookup/v90/0000000001_0000000264/records_8660_00000588.jsonl", 
    "type": "ScholarlyArticle", 
    "url": "http://link.springer.com/10.1007%2Fs10878-015-9888-4"
  }
]
 

Download the RDF metadata as:  json-ld nt turtle xml License info

HOW TO GET THIS DATA PROGRAMMATICALLY:

JSON-LD is a popular format for linked data which is fully compatible with JSON.

curl -H 'Accept: application/ld+json' 'https://scigraph.springernature.com/pub.10.1007/s10878-015-9888-4'

N-Triples is a line-based linked data format ideal for batch operations.

curl -H 'Accept: application/n-triples' 'https://scigraph.springernature.com/pub.10.1007/s10878-015-9888-4'

Turtle is a human-readable linked data format.

curl -H 'Accept: text/turtle' 'https://scigraph.springernature.com/pub.10.1007/s10878-015-9888-4'

RDF/XML is a standard XML format for linked data.

curl -H 'Accept: application/rdf+xml' 'https://scigraph.springernature.com/pub.10.1007/s10878-015-9888-4'


 

This table displays all metadata directly associated to this object as RDF triples.

105 TRIPLES      21 PREDICATES      37 URIs      19 LITERALS      7 BLANK NODES

Subject Predicate Object
1 sg:pub.10.1007/s10878-015-9888-4 schema:about anzsrc-for:01
2 anzsrc-for:0101
3 schema:author Naea53e58348b40d9b24ac2c0f9b5b4ee
4 schema:citation sg:pub.10.1007/978-1-349-03521-2
5 sg:pub.10.1007/s10878-011-9409-z
6 sg:pub.10.1007/s10878-012-9507-6
7 sg:pub.10.1007/s10878-013-9700-2
8 https://app.dimensions.ai/details/publication/pub.1109703686
9 https://doi.org/10.1002/jgt.10077
10 https://doi.org/10.1016/j.disc.2009.06.029
11 https://doi.org/10.1016/j.ejc.2007.11.005
12 https://doi.org/10.1016/j.jctb.2004.12.005
13 https://doi.org/10.1137/s0895480101390448
14 schema:datePublished 2016-08
15 schema:datePublishedReg 2016-08-01
16 schema:description A vertex coloring is called 2-distance if any two vertices at distance at most 2 from each other get different colors. The minimum number of colors in 2-distance colorings of G is its 2-distance chromatic number, denoted by χ2(G). Let G be a plane graph with girth at least 5. In this paper, we prove that χ2(G)≤Δ+8 for arbitrary Δ(G), which partially improves some known results.
17 schema:genre research_article
18 schema:inLanguage en
19 schema:isAccessibleForFree false
20 schema:isPartOf Ne73e27e57959495d8ddead409a61b2d6
21 Nfb78b55692594aa58c5848d63f12c8c2
22 sg:journal.1036683
23 schema:name An improved bound on 2-distance coloring plane graphs with girth 5
24 schema:pagination 645-655
25 schema:productId N2d50ee920021498189fbb2859f3a70ae
26 N6d19fe22e5df48e7857140a3325cbd52
27 Na2b2a6fe7e794df49c00294c5d947c79
28 schema:sameAs https://app.dimensions.ai/details/publication/pub.1029544188
29 https://doi.org/10.1007/s10878-015-9888-4
30 schema:sdDatePublished 2019-04-10T14:21
31 schema:sdLicense https://scigraph.springernature.com/explorer/license/
32 schema:sdPublisher N516f26b5768c452aa29cf40efc584ce8
33 schema:url http://link.springer.com/10.1007%2Fs10878-015-9888-4
34 sgo:license sg:explorer/license/
35 sgo:sdDataset articles
36 rdf:type schema:ScholarlyArticle
37 N16c3e0a5c3464a868cfe679072c4e576 rdf:first sg:person.012212777401.48
38 rdf:rest rdf:nil
39 N2d50ee920021498189fbb2859f3a70ae schema:name readcube_id
40 schema:value 8cbeb43105afaebf99ee8fcdd853890bcf43881ba15520dd962c3e660e568875
41 rdf:type schema:PropertyValue
42 N516f26b5768c452aa29cf40efc584ce8 schema:name Springer Nature - SN SciGraph project
43 rdf:type schema:Organization
44 N6d19fe22e5df48e7857140a3325cbd52 schema:name doi
45 schema:value 10.1007/s10878-015-9888-4
46 rdf:type schema:PropertyValue
47 Na2b2a6fe7e794df49c00294c5d947c79 schema:name dimensions_id
48 schema:value pub.1029544188
49 rdf:type schema:PropertyValue
50 Naea53e58348b40d9b24ac2c0f9b5b4ee rdf:first sg:person.014055474150.78
51 rdf:rest N16c3e0a5c3464a868cfe679072c4e576
52 Ne73e27e57959495d8ddead409a61b2d6 schema:issueNumber 2
53 rdf:type schema:PublicationIssue
54 Nfb78b55692594aa58c5848d63f12c8c2 schema:volumeNumber 32
55 rdf:type schema:PublicationVolume
56 anzsrc-for:01 schema:inDefinedTermSet anzsrc-for:
57 schema:name Mathematical Sciences
58 rdf:type schema:DefinedTerm
59 anzsrc-for:0101 schema:inDefinedTermSet anzsrc-for:
60 schema:name Pure Mathematics
61 rdf:type schema:DefinedTerm
62 sg:journal.1036683 schema:issn 1382-6905
63 1573-2886
64 schema:name Journal of Combinatorial Optimization
65 rdf:type schema:Periodical
66 sg:person.012212777401.48 schema:affiliation https://www.grid.ac/institutes/grid.263826.b
67 schema:familyName Lin
68 schema:givenName Wensong
69 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.012212777401.48
70 rdf:type schema:Person
71 sg:person.014055474150.78 schema:affiliation https://www.grid.ac/institutes/grid.440845.9
72 schema:familyName Dong
73 schema:givenName Wei
74 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.014055474150.78
75 rdf:type schema:Person
76 sg:pub.10.1007/978-1-349-03521-2 schema:sameAs https://app.dimensions.ai/details/publication/pub.1109703686
77 https://doi.org/10.1007/978-1-349-03521-2
78 rdf:type schema:CreativeWork
79 sg:pub.10.1007/s10878-011-9409-z schema:sameAs https://app.dimensions.ai/details/publication/pub.1050611643
80 https://doi.org/10.1007/s10878-011-9409-z
81 rdf:type schema:CreativeWork
82 sg:pub.10.1007/s10878-012-9507-6 schema:sameAs https://app.dimensions.ai/details/publication/pub.1008734638
83 https://doi.org/10.1007/s10878-012-9507-6
84 rdf:type schema:CreativeWork
85 sg:pub.10.1007/s10878-013-9700-2 schema:sameAs https://app.dimensions.ai/details/publication/pub.1007996173
86 https://doi.org/10.1007/s10878-013-9700-2
87 rdf:type schema:CreativeWork
88 https://app.dimensions.ai/details/publication/pub.1109703686 schema:CreativeWork
89 https://doi.org/10.1002/jgt.10077 schema:sameAs https://app.dimensions.ai/details/publication/pub.1001701992
90 rdf:type schema:CreativeWork
91 https://doi.org/10.1016/j.disc.2009.06.029 schema:sameAs https://app.dimensions.ai/details/publication/pub.1012808550
92 rdf:type schema:CreativeWork
93 https://doi.org/10.1016/j.ejc.2007.11.005 schema:sameAs https://app.dimensions.ai/details/publication/pub.1053537383
94 rdf:type schema:CreativeWork
95 https://doi.org/10.1016/j.jctb.2004.12.005 schema:sameAs https://app.dimensions.ai/details/publication/pub.1001705660
96 rdf:type schema:CreativeWork
97 https://doi.org/10.1137/s0895480101390448 schema:sameAs https://app.dimensions.ai/details/publication/pub.1062882601
98 rdf:type schema:CreativeWork
99 https://www.grid.ac/institutes/grid.263826.b schema:alternateName Southeast University
100 schema:name Department of Mathematics, Southeast University, 211189, Nanjing, China
101 rdf:type schema:Organization
102 https://www.grid.ac/institutes/grid.440845.9 schema:alternateName Nanjing Xiaozhuang University
103 schema:name Department of Mathematics, Southeast University, 211189, Nanjing, China
104 School of Mathematics and Information Technology, Nanjing Xiaozhuang University, 211171, Nanjing, China
105 rdf:type schema:Organization
 




Preview window. Press ESC to close (or click here)


...