{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,4]],"date-time":"2022-04-04T15:58:23Z","timestamp":1649087903470},"reference-count":23,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2012,11,14]],"date-time":"2012-11-14T00:00:00Z","timestamp":1352851200000},"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":[[2014,8]]},"DOI":"10.1007\/s10878-012-9563-y","type":"journal-article","created":{"date-parts":[[2012,11,13]],"date-time":"2012-11-13T19:59:18Z","timestamp":1352836758000},"page":"400-413","source":"Crossref","is-referenced-by-count":1,"title":["$$F_{3}$$ -domination problem of graphs"],"prefix":"10.1007","volume":"28","author":[{"given":"Chan-Wei","family":"Chang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"David","family":"Kuo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sheng-Chyang","family":"Liaw","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jing-Ho","family":"Yan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2012,11,14]]},"reference":[{"key":"9563_CR1","doi-asserted-by":"crossref","unstructured":"Chang GJ, Chang CW, Kuo D, Poon SH (2012) Algorithmic aspect of stratified domination in graphs, preprint","DOI":"10.1007\/978-1-4419-7997-1_26"},{"key":"9563_CR2","first-page":"81","volume":"107","author":"G Chartrand","year":"1995","unstructured":"Chartrand G, Eroh L, Rashidi R, Schultz M, Sherwani NA (1995) Distance, stratified graphs, and greatest stratified subgraphs. Congr Numer 107:81\u201386","journal-title":"Congr Numer"},{"key":"9563_CR3","doi-asserted-by":"crossref","first-page":"337","DOI":"10.21136\/MB.1997.126213","volume":"122","author":"G Chartrand","year":"1997","unstructured":"Chartrand G, Gavlas H, Henning MA, Rashidi R (1997) Stratidistance in stratified graphs. Math Bohem 122:337\u2013347","journal-title":"Math Bohem"},{"key":"9563_CR4","first-page":"81","volume":"33","author":"G Chartrand","year":"2000","unstructured":"Chartrand G, Haynes TW, Henning MA, Zhang P (2000a) Stratified claw domination in prisms. J Combin Math Combin Comput 33:81\u201396","journal-title":"J Combin Math Combin Comput"},{"key":"9563_CR5","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1023\/A:1022428917827","volume":"50","author":"G Chartrand","year":"2000","unstructured":"Chartrand G, Holley L, Rashidi R, Sherwani NA (2000b) Distance in stratified graphs. Czechoslov Math J 50:35\u201346","journal-title":"Czechoslov Math J"},{"key":"9563_CR6","doi-asserted-by":"crossref","first-page":"171","DOI":"10.1016\/S0012-365X(03)00078-5","volume":"272","author":"G Chartrand","year":"2003","unstructured":"Chartrand G, Haynes TW, Henning MA, Zhang P (2003) Stratification and domination in graphs. Discret Math 272:171\u2013185","journal-title":"Discret Math"},{"key":"9563_CR7","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1002\/net.3230100304","volume":"10","author":"EJ Cockayne","year":"1980","unstructured":"Cockayne EJ, Dawes RM, Hedetniemi ST (1980) Total domination in graphs. Networks 10:211\u2013219","journal-title":"Networks"},{"key":"9563_CR8","first-page":"283","volume-title":"Graph theory with applications to algorithms and computer science, (Kalamazoo, MI 1984)","author":"JF Fink","year":"1985","unstructured":"Fink JF, Jacobson MS (1985) $$n$$ -domination in graphs. In: Alavi Y, Schwenk AJ (eds) Graph theory with applications to algorithms and computer science, (Kalamazoo, MI 1984). Wiley, New York, pp 283\u2013300"},{"key":"9563_CR9","first-page":"131","volume":"166","author":"R Gera","year":"2004","unstructured":"Gera R, Zhang P (2004) Bounds for the $$F$$ -domination number of a graph. Congr Numer 166:131\u2013144","journal-title":"Congr Numer"},{"key":"9563_CR10","doi-asserted-by":"crossref","first-page":"185","DOI":"10.21136\/MB.2005.134128","volume":"130","author":"R Gera","year":"2005","unstructured":"Gera R, Zhang P (2005a) Realizable triples for stratified domination in graphs. Math Bohem 130:185\u2013202","journal-title":"Math Bohem"},{"key":"9563_CR11","first-page":"175","volume":"173","author":"R Gera","year":"2005","unstructured":"Gera R, Zhang P (2005b) On stratified domination in oriented graphs. Congr Numer 173:175\u2013192","journal-title":"Congr Numer"},{"key":"9563_CR12","doi-asserted-by":"crossref","first-page":"249","DOI":"10.7151\/dmgt.1317","volume":"26","author":"R Gera","year":"2006","unstructured":"Gera R, Zhang P (2006) On stratification and domination in graphs. Discuss Math Graph Theory 26:249\u2013272","journal-title":"Discuss Math Graph Theory"},{"key":"9563_CR13","first-page":"105","volume":"60","author":"R Gera","year":"2007","unstructured":"Gera R, Zhang P (2007) Stratified domination in oriented graphs. J Combin Math Combin Comput 60:105\u2013125","journal-title":"J Combin Math Combin Comput"},{"key":"9563_CR14","volume-title":"Fundamentals of domination in graphs","author":"TW Haynes","year":"1998","unstructured":"Haynes TW, Hedetniemi ST, Slater PJ (1998a) Fundamentals of domination in graphs. Marcel Dekker, New York"},{"key":"9563_CR15","volume-title":"Domination in graphs: advanced topics","year":"1998","unstructured":"Haynes TW, Hedetniemi ST, Slater PJ (eds) (1998b) Domination in graphs: advanced topics. Marcel Dekker, New York"},{"key":"9563_CR16","doi-asserted-by":"crossref","first-page":"5806","DOI":"10.1016\/j.disc.2008.02.048","volume":"309","author":"TW Haynes","year":"2009","unstructured":"Haynes TW, Henning MA, Zhang P (2009) A survey of stratified domination in graphs. Discret Math 309:5806\u20135819","journal-title":"Discret Math"},{"key":"9563_CR17","doi-asserted-by":"crossref","first-page":"203","DOI":"10.1016\/j.disc.2004.03.006","volume":"286","author":"MA Henning","year":"2004","unstructured":"Henning MA, Maritz JE (2004) Stratification and domination in graphs II. Discret Math 286:203\u2013211","journal-title":"Discret Math"},{"key":"9563_CR18","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1016\/j.disc.2005.06.021","volume":"301","author":"MA Henning","year":"2005","unstructured":"Henning MA, Maritz JE (2005) Stratification and domination in graphs with minimum degree two. Discret Math 301:175\u2013194","journal-title":"Discret Math"},{"key":"9563_CR19","first-page":"343","volume":"81","author":"MA Henning","year":"2006","unstructured":"Henning MA, Maritz JE (2006a) Stratification and domination in prisms. Ars Combin 81:343\u2013358","journal-title":"Ars Combin"},{"key":"9563_CR20","doi-asserted-by":"crossref","first-page":"1","DOI":"10.2989\/16073600609486166","volume":"29","author":"MA Henning","year":"2006","unstructured":"Henning MA, Maritz JE (2006b) Simultaneous stratification and domination in graphs with minimum degree two. Quaest Math 29:1\u201316","journal-title":"Quaest Math"},{"key":"9563_CR21","unstructured":"Rashidi R (1994) The theory and applications of stratified graphs. PhD Dissertation, Western Michigan University, Kalamazoo"},{"key":"9563_CR22","doi-asserted-by":"crossref","first-page":"529","DOI":"10.1137\/S0895480194275825","volume":"10","author":"JA Telle","year":"1997","unstructured":"Telle JA, Proskurowski A (1997) Algorithms for vertex partitioning problems on partial k-trees. SIAM J Discret Math 10:529\u2013550","journal-title":"SIAM J Discret Math"},{"key":"9563_CR23","unstructured":"Wang FH (2012) An upper bound on $$F$$ -domination number in grids, preprint"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-012-9563-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-012-9563-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-012-9563-y","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,31]],"date-time":"2022-01-31T07:44:07Z","timestamp":1643615047000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-012-9563-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,11,14]]},"references-count":23,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2014,8]]}},"alternative-id":["9563"],"URL":"https:\/\/doi.org\/10.1007\/s10878-012-9563-y","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,11,14]]}}}