{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,8,7]],"date-time":"2024-08-07T06:33:38Z","timestamp":1723012418256},"reference-count":11,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2011,1,27]],"date-time":"2011-01-27T00:00:00Z","timestamp":1296086400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2012,10]]},"DOI":"10.1007\/s10878-011-9388-0","type":"journal-article","created":{"date-parts":[[2011,1,26]],"date-time":"2011-01-26T15:46:37Z","timestamp":1296056797000},"page":"329-338","source":"Crossref","is-referenced-by-count":1,"title":["A Nordhaus-Gaddum-type result for the induced path number"],"prefix":"10.1007","volume":"24","author":[{"given":"Johannes H.","family":"Hattingh","sequence":"first","affiliation":[]},{"given":"Osama A.","family":"Saleh","sequence":"additional","affiliation":[]},{"given":"Lucas C.","family":"van\u00a0der Merwe","sequence":"additional","affiliation":[]},{"given":"Terry J.","family":"Walters","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2011,1,27]]},"reference":[{"key":"9388_CR1","first-page":"15","volume":"33","author":"I Broere","year":"2005","unstructured":"Broere I, Domke GS, Jonck E, Markus LR (2005) The induced path number of the complements of some graphs. Australas J Combin 33:15\u201332","journal-title":"Australas J Combin"},{"key":"9388_CR2","volume-title":"Graphs & digraphs","author":"G Chartrand","year":"1996","unstructured":"Chartrand G, Lesniak L (1996) Graphs & digraphs, 3rd edn. Chapman & Hall, London","edition":"3"},{"key":"9388_CR3","series-title":"Lecture notes in math","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1007\/BFb0059422","volume-title":"Recent trends in graph theory","author":"G Chartrand","year":"1971","unstructured":"Chartrand G, Mitchem J (1971) Graphical theorems of the Nordhaus-Gaddum class. In: Recent trends in graph theory. Lecture notes in math, vol 186. Springer, Berlin, pp 55\u201361"},{"key":"9388_CR4","first-page":"191","volume":"37","author":"G Chartrand","year":"1994","unstructured":"Chartrand G, Hashmi J, Hossain M, McCanna J, Sherwani N (1994) The induced path number of bipartite graphs. Ars Comb 37:191\u2013208","journal-title":"Ars Comb"},{"key":"9388_CR5","unstructured":"Cockayne EJ (1988) Variations on the domination number of a graph. Lecture at the University of Natal, May 1988"},{"key":"9388_CR6","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1002\/jgt.3190160305","volume":"16","author":"W Goddard","year":"1992","unstructured":"Goddard W, Henning MA, Swart HC (1992) Some Nordhaus-Gaddum-type results. J Graph Theory 16:221\u2013231","journal-title":"J Graph Theory"},{"key":"9388_CR7","first-page":"728","volume":"274","author":"F Jaeger","year":"1972","unstructured":"Jaeger F, Payan C (1972) Relations du type Nordhaus-Gaddum pour le\u00a0nombre d\u2019absorption d\u2019un simple. C R Acad Sci Ser A 274:728\u2013730","journal-title":"C R Acad Sci Ser A"},{"key":"9388_CR8","unstructured":"Joseph JP, Arumugam S (2011, submitted) A note on domination in graphs"},{"key":"9388_CR9","doi-asserted-by":"crossref","first-page":"175","DOI":"10.2307\/2306658","volume":"63","author":"EA Nordhaus","year":"1956","unstructured":"Nordhaus EA, Gaddum JW (1956) On complementary graphs. Am Math Mon 63:175\u2013177","journal-title":"Am Math Mon"},{"key":"9388_CR10","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1002\/jgt.3190060104","volume":"6","author":"C Payan","year":"1982","unstructured":"Payan C, Xuong NH (1982) Domination-balanced graphs. J Graph Theory 6:23\u201332","journal-title":"J Graph Theory"},{"key":"9388_CR11","doi-asserted-by":"crossref","first-page":"9","DOI":"10.1002\/jgt.3190020103","volume":"2","author":"J Plesn\u00edk","year":"1978","unstructured":"Plesn\u00edk J (1978) Bounds on chromatic numbers of multiple factors of a complete graph. J Graph Theory 2:9\u201317","journal-title":"J Graph Theory"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-011-9388-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-011-9388-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-011-9388-0","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T04:23:15Z","timestamp":1559276595000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-011-9388-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,1,27]]},"references-count":11,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2012,10]]}},"alternative-id":["9388"],"URL":"https:\/\/doi.org\/10.1007\/s10878-011-9388-0","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,1,27]]}}}