乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,2]],"date-time":"2024-07-02T17:31:30Z","timestamp":1719941490990},"reference-count":34,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2015,2,1]],"date-time":"2015-02-01T00:00:00Z","timestamp":1422748800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2019,2,2]],"date-time":"2019-02-02T00:00:00Z","timestamp":1549065600000},"content-version":"vor","delay-in-days":1462,"URL":"http:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"funder":[{"DOI":"10.13039\/501100004329","name":"\u201cAgencija za raziskovalno dejavnost Republike Slovenije\u201d","doi-asserted-by":"publisher","award":["P1\u20130285"],"id":[{"id":"10.13039\/501100004329","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001801","name":"UWA","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100001801","id-type":"DOI","asserted-by":"publisher"}]},{"name":"ARC","award":["DE130101001"]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["European Journal of Combinatorics"],"published-print":{"date-parts":[[2015,2]]},"DOI":"10.1016\/j.ejc.2014.09.007","type":"journal-article","created":{"date-parts":[[2014,10,10]],"date-time":"2014-10-10T14:30:15Z","timestamp":1412951415000},"page":"87-98","update-policy":"http:\/\/dx.doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":11,"special_numbering":"PA","title":["Vertex-transitive CIS graphs"],"prefix":"10.1016","volume":"44","author":[{"given":"Edward","family":"Dobson","sequence":"first","affiliation":[]},{"given":"Ademir","family":"Hujdurovi\u0107","sequence":"additional","affiliation":[]},{"ORCID":"http:\/\/orcid.org\/0000-0002-8222-8097","authenticated-orcid":false,"given":"Martin","family":"Milani\u010d","sequence":"additional","affiliation":[]},{"given":"Gabriel","family":"Verret","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/j.ejc.2014.09.007_br000005","unstructured":"D.V. Andrade, E. Boros, V. Gurvich, On graphs whose maximal cliques and stable sets intersect. RRR 17-2006, RUTCOR Research Reports, Rutgers University."},{"key":"10.1016\/j.ejc.2014.09.007_br000010","series-title":"Graphs and Order","first-page":"583","article-title":"Problems 9.11 and 9.12","author":"Berge","year":"1985"},{"key":"10.1016\/j.ejc.2014.09.007_br000015","doi-asserted-by":"crossref","first-page":"78","DOI":"10.1016\/j.disc.2013.11.015","article-title":"On CIS circulants","volume":"318","author":"Boros","year":"2014","journal-title":"Discrete Math."},{"key":"10.1016\/j.ejc.2014.09.007_br000020","unstructured":"E. Boros, V. Gurvich, M. Milani\u010d, On equistable, split, CIS, and related classes of graphs, 2014, submitted for publication."},{"key":"10.1016\/j.ejc.2014.09.007_br000025","first-page":"163","article-title":"On split and almost CIS-graphs","volume":"43","author":"Boros","year":"2009","journal-title":"Australas. J. Combin."},{"issue":"4","key":"10.1016\/j.ejc.2014.09.007_br000030","doi-asserted-by":"crossref","first-page":"244","DOI":"10.1016\/j.disc.2010.11.007","article-title":"Well-covered circulant graphs","volume":"311","author":"Brown","year":"2011","journal-title":"Discrete Math."},{"issue":"4","key":"10.1016\/j.ejc.2014.09.007_br000035","doi-asserted-by":"crossref","first-page":"952","DOI":"10.1137\/S0895480101393039","article-title":"Well-covered vector spaces of graphs","volume":"19","author":"Brown","year":"2005","journal-title":"SIAM J. Discrete Math."},{"issue":"17\u201318","key":"10.1016\/j.ejc.2014.09.007_br000040","doi-asserted-by":"crossref","first-page":"2235","DOI":"10.1016\/j.disc.2006.10.011","article-title":"The structure of well-covered graphs with no cycles of length 4","volume":"307","author":"Brown","year":"2007","journal-title":"Discrete Math."},{"issue":"1","key":"10.1016\/j.ejc.2014.09.007_br000045","doi-asserted-by":"crossref","first-page":"51","DOI":"10.4007\/annals.2006.164.51","article-title":"The strong perfect graph theorem","volume":"164","author":"Chudnovsky","year":"2006","journal-title":"Ann. of Math. (2)"},{"key":"10.1016\/j.ejc.2014.09.007_br000050","unstructured":"D.W. Cranston, L. Rabern, A note on coloring vertex-transitive graphs. arXiv:1404.6550 \u00a0[math.CO]."},{"issue":"2","key":"10.1016\/j.ejc.2014.09.007_br000055","doi-asserted-by":"crossref","first-page":"301","DOI":"10.1016\/j.jctb.2004.03.002","article-title":"Proof of Chv\u00e1tal\u2019s conjecture on maximal stable sets and maximal cliques in graphs","volume":"91","author":"Deng","year":"2004","journal-title":"J. Combin. Theory Ser. B"},{"issue":"2","key":"10.1016\/j.ejc.2014.09.007_br000060","doi-asserted-by":"crossref","first-page":"352","DOI":"10.1016\/j.jctb.2005.02.003","article-title":"Corrigendum to: Proof of Chv\u00e1tal\u2019s conjecture on maximal stable sets and maximal cliques in graphs [J. Combin. Theory Ser. B 91 (2004), no. 2, 301\u2013325; mr2064873]","volume":"94","author":"Deng","year":"2005","journal-title":"J. Combin. Theory Ser. B"},{"issue":"13","key":"10.1016\/j.ejc.2014.09.007_br000065","doi-asserted-by":"crossref","first-page":"2799","DOI":"10.1016\/j.dam.2009.03.014","article-title":"On well-covered triangulations. II","volume":"157","author":"Finbow","year":"2009","journal-title":"Discrete Appl. Math."},{"issue":"8","key":"10.1016\/j.ejc.2014.09.007_br000070","doi-asserted-by":"crossref","first-page":"894","DOI":"10.1016\/j.dam.2009.08.002","article-title":"On well-covered triangulations. III","volume":"158","author":"Finbow","year":"2010","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/j.ejc.2014.09.007_br000075","series-title":"Algorithmic Graph Theory and Perfect Graphs","volume":"vol. 57","author":"Golumbic","year":"2004"},{"key":"10.1016\/j.ejc.2014.09.007_br000080","doi-asserted-by":"crossref","first-page":"157","DOI":"10.4064\/fm-65-2-157-167","article-title":"Maximal chains and antichains","volume":"65","author":"Grillet","year":"1969","journal-title":"Fund. Math."},{"issue":"39","key":"10.1016\/j.ejc.2014.09.007_br000085","doi-asserted-by":"crossref","first-page":"5466","DOI":"10.1016\/j.tcs.2011.06.016","article-title":"Graphs of linear clique-width at most 3","volume":"412","author":"Heggernes","year":"2011","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/j.ejc.2014.09.007_br000090","first-page":"313","article-title":"Stable well-covered graphs","volume":"93","author":"King","year":"2009","journal-title":"Ars Combin."},{"key":"10.1016\/j.ejc.2014.09.007_br000095","series-title":"In Graph-Theoretic Concepts in Computer Science (Herrsching, 1994)","first-page":"106","article-title":"Dominoes","volume":"vol. 903","author":"Kloks","year":"1995"},{"key":"10.1016\/j.ejc.2014.09.007_br000100","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1016\/0095-8956(72)90045-7","article-title":"A characterization of perfect graphs","volume":"13","author":"Lov\u00e1sz","year":"1972","journal-title":"J. Combinatorial Theory Ser. B"},{"issue":"2","key":"10.1016\/j.ejc.2014.09.007_br000105","doi-asserted-by":"crossref","first-page":"269","DOI":"10.7155\/jgaa.00207","article-title":"On the maximum independent set problem in subclasses of planar graphs","volume":"14","author":"Lozin","year":"2010","journal-title":"J. Graph Algorithms Appl."},{"issue":"135","key":"10.1016\/j.ejc.2014.09.007_br000110","doi-asserted-by":"crossref","first-page":"1037","DOI":"10.1007\/s10587-010-0067-6","article-title":"A class of weakly perfect graphs","volume":"60","author":"Maimani","year":"2010","journal-title":"Czechoslovak Math. J."},{"issue":"3","key":"10.1016\/j.ejc.2014.09.007_br000115","doi-asserted-by":"crossref","first-page":"417","DOI":"10.1017\/S0017089510000108","article-title":"Weakly perfect graphs arising from rings","volume":"52","author":"Maimani","year":"2010","journal-title":"Glasg. Math. J."},{"issue":"1","key":"10.1016\/j.ejc.2014.09.007_br000120","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1017\/S144678870003473X","article-title":"Vertex\u2013transitive graphs which are not Cayley graphs. I","volume":"56","author":"McKay","year":"1994","journal-title":"J. Aust. Math. Soc. Ser. A"},{"key":"10.1016\/j.ejc.2014.09.007_br000125","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1016\/S0021-9800(70)80011-4","article-title":"Some covering concepts in graphs","volume":"8","author":"Plummer","year":"1970","journal-title":"J. Combin. Theory"},{"issue":"3","key":"10.1016\/j.ejc.2014.09.007_br000130","doi-asserted-by":"crossref","first-page":"253","DOI":"10.1080\/16073606.1993.9631737","article-title":"Well-covered graphs: a survey","volume":"16","author":"Plummer","year":"1993","journal-title":"Quaest. Math."},{"issue":"1","key":"10.1016\/j.ejc.2014.09.007_br000135","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1016\/S0195-6698(89)80037-X","article-title":"A characterization of a class of symmetric graphs of twice prime valency","volume":"10","author":"Praeger","year":"1989","journal-title":"European J. Combin."},{"key":"10.1016\/j.ejc.2014.09.007_br000140","unstructured":"G. Royle, Transitive graphs. http:\/\/school.maths.uwa.edu.au\/~gordon\/trans\/."},{"key":"10.1016\/j.ejc.2014.09.007_br000145","doi-asserted-by":"crossref","first-page":"800","DOI":"10.1090\/S0002-9939-1958-0097068-7","article-title":"On a class of fixed-point-free graphs","volume":"9","author":"Sabidussi","year":"1958","journal-title":"Proc. Amer. Math. Soc."},{"issue":"2","key":"10.1016\/j.ejc.2014.09.007_br000150","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1002\/jgt.3190030209","article-title":"Randomly matchable graphs","volume":"3","author":"Sumner","year":"1979","journal-title":"J. Graph Theory"},{"issue":"3","key":"10.1016\/j.ejc.2014.09.007_br000155","doi-asserted-by":"crossref","first-page":"473","DOI":"10.1007\/s10255-006-6185-0","article-title":"Proof of Ding\u2019s conjecture on maximal stable sets and maximal cliques in planar graphs","volume":"26","author":"Sun","year":"2010","journal-title":"Acta Math. Appl. Sin. Engl. Ser."},{"issue":"2","key":"10.1016\/j.ejc.2014.09.007_br000160","doi-asserted-by":"crossref","first-page":"749","DOI":"10.1137\/080723739","article-title":"A characterization of almost CIS graphs","volume":"23","author":"Wu","year":"2009","journal-title":"SIAM J. Discrete Math."},{"issue":"1\u20133","key":"10.1016\/j.ejc.2014.09.007_br000165","doi-asserted-by":"crossref","first-page":"259","DOI":"10.1016\/0012-365X(94)00019-F","article-title":"Generalizations of Grillet\u2019s theorem on maximal stable sets and maximal cliques in graphs","volume":"143","author":"Zang","year":"1995","journal-title":"Discrete Math."},{"issue":"8\u20139","key":"10.1016\/j.ejc.2014.09.007_br000170","doi-asserted-by":"crossref","first-page":"801","DOI":"10.1016\/j.disc.2005.10.026","article-title":"Bipartite bihypergraphs: a survey and new results","volume":"306","author":"Zverovich","year":"2006","journal-title":"Discrete Math."}],"container-title":["European Journal of Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0195669814001516?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0195669814001516?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,8,10]],"date-time":"2019-08-10T09:42:26Z","timestamp":1565430146000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0195669814001516"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,2]]},"references-count":34,"alternative-id":["S0195669814001516"],"URL":"https:\/\/doi.org\/10.1016\/j.ejc.2014.09.007","relation":{},"ISSN":["0195-6698"],"issn-type":[{"value":"0195-6698","type":"print"}],"subject":[],"published":{"date-parts":[[2015,2]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Vertex-transitive CIS graphs","name":"articletitle","label":"Article Title"},{"value":"European Journal of Combinatorics","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.ejc.2014.09.007","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 2014 Elsevier Ltd. All rights reserved.","name":"copyright","label":"Copyright"}]}}