Colorings and orientations of graphs View Full Text


Ontology type: schema:ScholarlyArticle      Open Access: True


Article Info

DATE

1992-06

AUTHORS

N. Alon, M. Tarsi

ABSTRACT

Bounds for the chromatic number and for some related parameters of a graph are obtained by applying algebraic techniques. In particular, the following result is proved: IfG is a directed graph with maximum outdegreed, and if the number of Eulerian subgraphs ofG with an even number of edges differs from the number of Eulerian subgraphs with an odd number of edges then for any assignment of a setS(v) ofd+1 colors for each vertexv ofG there is a legal vertex-coloring ofG assigning to each vertexv a color fromS(v). More... »

PAGES

125-134

References to SciGraph publications

Journal

TITLE

Combinatorica

ISSUE

2

VOLUME

12

Author Affiliations

Identifiers

URI

http://scigraph.springernature.com/pub.10.1007/bf01204715

DOI

http://dx.doi.org/10.1007/bf01204715

DIMENSIONS

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


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": "Tel Aviv University", 
          "id": "https://www.grid.ac/institutes/grid.12136.37", 
          "name": [
            "Department of Pure Mathematics School of Mathematical Sciences Raymond and Beverly Sackler Faculty of Exact Sciences, Tel Aviv University, Tel Aviv, Israel"
          ], 
          "type": "Organization"
        }, 
        "familyName": "Alon", 
        "givenName": "N.", 
        "id": "sg:person.0765221225.03", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.0765221225.03"
        ], 
        "type": "Person"
      }, 
      {
        "affiliation": {
          "alternateName": "Tel Aviv University", 
          "id": "https://www.grid.ac/institutes/grid.12136.37", 
          "name": [
            "Department of Computer Science School of Mathematical Sciences Raymond and Beverly Sackler Faculty of Exact Sciences, Tel Aviv University, Tel Aviv, Israel"
          ], 
          "type": "Organization"
        }, 
        "familyName": "Tarsi", 
        "givenName": "M.", 
        "id": "sg:person.016662670541.87", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.016662670541.87"
        ], 
        "type": "Person"
      }
    ], 
    "citation": [
      {
        "id": "https://doi.org/10.1016/0012-365x(73)90108-8", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1002071683"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "https://doi.org/10.1016/s0012-365x(81)80025-8", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1013176201"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "sg:pub.10.1007/bf02579177", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1030969231", 
          "https://doi.org/10.1007/bf02579177"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "https://doi.org/10.1016/0095-8956(84)90047-9", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1042912155"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "https://doi.org/10.1002/jgt.3190030315", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1044236153"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "https://doi.org/10.1002/jgt.3190130112", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1044773707"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "sg:pub.10.1007/bf02125351", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1053664385", 
          "https://doi.org/10.1007/bf02125351"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "sg:pub.10.1007/bf02125351", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1053664385", 
          "https://doi.org/10.1007/bf02125351"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "https://doi.org/10.1137/0601002", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1062848626"
        ], 
        "type": "CreativeWork"
      }
    ], 
    "datePublished": "1992-06", 
    "datePublishedReg": "1992-06-01", 
    "description": "Bounds for the chromatic number and for some related parameters of a graph are obtained by applying algebraic techniques. In particular, the following result is proved: IfG is a directed graph with maximum outdegreed, and if the number of Eulerian subgraphs ofG with an even number of edges differs from the number of Eulerian subgraphs with an odd number of edges then for any assignment of a setS(v) ofd+1 colors for each vertexv ofG there is a legal vertex-coloring ofG assigning to each vertexv a color fromS(v).", 
    "genre": "research_article", 
    "id": "sg:pub.10.1007/bf01204715", 
    "inLanguage": [
      "en"
    ], 
    "isAccessibleForFree": true, 
    "isPartOf": [
      {
        "id": "sg:journal.1136493", 
        "issn": [
          "0209-9683", 
          "1439-6912"
        ], 
        "name": "Combinatorica", 
        "type": "Periodical"
      }, 
      {
        "issueNumber": "2", 
        "type": "PublicationIssue"
      }, 
      {
        "type": "PublicationVolume", 
        "volumeNumber": "12"
      }
    ], 
    "name": "Colorings and orientations of graphs", 
    "pagination": "125-134", 
    "productId": [
      {
        "name": "readcube_id", 
        "type": "PropertyValue", 
        "value": [
          "3e62763dd86501e8d1d328553c79574c0bb4fc90aacc3d8a4c367e35d310a8ad"
        ]
      }, 
      {
        "name": "doi", 
        "type": "PropertyValue", 
        "value": [
          "10.1007/bf01204715"
        ]
      }, 
      {
        "name": "dimensions_id", 
        "type": "PropertyValue", 
        "value": [
          "pub.1013095644"
        ]
      }
    ], 
    "sameAs": [
      "https://doi.org/10.1007/bf01204715", 
      "https://app.dimensions.ai/details/publication/pub.1013095644"
    ], 
    "sdDataset": "articles", 
    "sdDatePublished": "2019-04-11T13:35", 
    "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/0000000370_0000000370/records_46775_00000000.jsonl", 
    "type": "ScholarlyArticle", 
    "url": "http://link.springer.com/10.1007/BF01204715"
  }
]
 

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/bf01204715'

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/bf01204715'

Turtle is a human-readable linked data format.

curl -H 'Accept: text/turtle' 'https://scigraph.springernature.com/pub.10.1007/bf01204715'

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

curl -H 'Accept: application/rdf+xml' 'https://scigraph.springernature.com/pub.10.1007/bf01204715'


 

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

95 TRIPLES      21 PREDICATES      35 URIs      19 LITERALS      7 BLANK NODES

Subject Predicate Object
1 sg:pub.10.1007/bf01204715 schema:about anzsrc-for:01
2 anzsrc-for:0101
3 schema:author N9b92b77b1df447b9bacd1b4779e4cbfe
4 schema:citation sg:pub.10.1007/bf02125351
5 sg:pub.10.1007/bf02579177
6 https://doi.org/10.1002/jgt.3190030315
7 https://doi.org/10.1002/jgt.3190130112
8 https://doi.org/10.1016/0012-365x(73)90108-8
9 https://doi.org/10.1016/0095-8956(84)90047-9
10 https://doi.org/10.1016/s0012-365x(81)80025-8
11 https://doi.org/10.1137/0601002
12 schema:datePublished 1992-06
13 schema:datePublishedReg 1992-06-01
14 schema:description Bounds for the chromatic number and for some related parameters of a graph are obtained by applying algebraic techniques. In particular, the following result is proved: IfG is a directed graph with maximum outdegreed, and if the number of Eulerian subgraphs ofG with an even number of edges differs from the number of Eulerian subgraphs with an odd number of edges then for any assignment of a setS(v) ofd+1 colors for each vertexv ofG there is a legal vertex-coloring ofG assigning to each vertexv a color fromS(v).
15 schema:genre research_article
16 schema:inLanguage en
17 schema:isAccessibleForFree true
18 schema:isPartOf N4cdcafae375e4999ab1cc80e456eb23f
19 N7bec757c42f24a8a97c4d1e81747ba9a
20 sg:journal.1136493
21 schema:name Colorings and orientations of graphs
22 schema:pagination 125-134
23 schema:productId N2e144acbefed40a7b7302896c9f63e4b
24 Nca3bc3578de243279181e6084411b8b6
25 Nee8e4a40affb4701ac241db8d27c7414
26 schema:sameAs https://app.dimensions.ai/details/publication/pub.1013095644
27 https://doi.org/10.1007/bf01204715
28 schema:sdDatePublished 2019-04-11T13:35
29 schema:sdLicense https://scigraph.springernature.com/explorer/license/
30 schema:sdPublisher N8ca040156dd541b0b6728e9414063c6c
31 schema:url http://link.springer.com/10.1007/BF01204715
32 sgo:license sg:explorer/license/
33 sgo:sdDataset articles
34 rdf:type schema:ScholarlyArticle
35 N2e144acbefed40a7b7302896c9f63e4b schema:name dimensions_id
36 schema:value pub.1013095644
37 rdf:type schema:PropertyValue
38 N4cdcafae375e4999ab1cc80e456eb23f schema:issueNumber 2
39 rdf:type schema:PublicationIssue
40 N7bec757c42f24a8a97c4d1e81747ba9a schema:volumeNumber 12
41 rdf:type schema:PublicationVolume
42 N8ca040156dd541b0b6728e9414063c6c schema:name Springer Nature - SN SciGraph project
43 rdf:type schema:Organization
44 N9b92b77b1df447b9bacd1b4779e4cbfe rdf:first sg:person.0765221225.03
45 rdf:rest Nf4d8c1c61c31439bac2c007ad3cbf7ee
46 Nca3bc3578de243279181e6084411b8b6 schema:name doi
47 schema:value 10.1007/bf01204715
48 rdf:type schema:PropertyValue
49 Nee8e4a40affb4701ac241db8d27c7414 schema:name readcube_id
50 schema:value 3e62763dd86501e8d1d328553c79574c0bb4fc90aacc3d8a4c367e35d310a8ad
51 rdf:type schema:PropertyValue
52 Nf4d8c1c61c31439bac2c007ad3cbf7ee rdf:first sg:person.016662670541.87
53 rdf:rest rdf:nil
54 anzsrc-for:01 schema:inDefinedTermSet anzsrc-for:
55 schema:name Mathematical Sciences
56 rdf:type schema:DefinedTerm
57 anzsrc-for:0101 schema:inDefinedTermSet anzsrc-for:
58 schema:name Pure Mathematics
59 rdf:type schema:DefinedTerm
60 sg:journal.1136493 schema:issn 0209-9683
61 1439-6912
62 schema:name Combinatorica
63 rdf:type schema:Periodical
64 sg:person.016662670541.87 schema:affiliation https://www.grid.ac/institutes/grid.12136.37
65 schema:familyName Tarsi
66 schema:givenName M.
67 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.016662670541.87
68 rdf:type schema:Person
69 sg:person.0765221225.03 schema:affiliation https://www.grid.ac/institutes/grid.12136.37
70 schema:familyName Alon
71 schema:givenName N.
72 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.0765221225.03
73 rdf:type schema:Person
74 sg:pub.10.1007/bf02125351 schema:sameAs https://app.dimensions.ai/details/publication/pub.1053664385
75 https://doi.org/10.1007/bf02125351
76 rdf:type schema:CreativeWork
77 sg:pub.10.1007/bf02579177 schema:sameAs https://app.dimensions.ai/details/publication/pub.1030969231
78 https://doi.org/10.1007/bf02579177
79 rdf:type schema:CreativeWork
80 https://doi.org/10.1002/jgt.3190030315 schema:sameAs https://app.dimensions.ai/details/publication/pub.1044236153
81 rdf:type schema:CreativeWork
82 https://doi.org/10.1002/jgt.3190130112 schema:sameAs https://app.dimensions.ai/details/publication/pub.1044773707
83 rdf:type schema:CreativeWork
84 https://doi.org/10.1016/0012-365x(73)90108-8 schema:sameAs https://app.dimensions.ai/details/publication/pub.1002071683
85 rdf:type schema:CreativeWork
86 https://doi.org/10.1016/0095-8956(84)90047-9 schema:sameAs https://app.dimensions.ai/details/publication/pub.1042912155
87 rdf:type schema:CreativeWork
88 https://doi.org/10.1016/s0012-365x(81)80025-8 schema:sameAs https://app.dimensions.ai/details/publication/pub.1013176201
89 rdf:type schema:CreativeWork
90 https://doi.org/10.1137/0601002 schema:sameAs https://app.dimensions.ai/details/publication/pub.1062848626
91 rdf:type schema:CreativeWork
92 https://www.grid.ac/institutes/grid.12136.37 schema:alternateName Tel Aviv University
93 schema:name Department of Computer Science School of Mathematical Sciences Raymond and Beverly Sackler Faculty of Exact Sciences, Tel Aviv University, Tel Aviv, Israel
94 Department of Pure Mathematics School of Mathematical Sciences Raymond and Beverly Sackler Faculty of Exact Sciences, Tel Aviv University, Tel Aviv, Israel
95 rdf:type schema:Organization
 




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


...