{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T20:11:09Z","timestamp":1743106269661,"version":"3.40.3"},"publisher-location":"Boston","reference-count":144,"publisher":"Birkh\u00e4user Boston","isbn-type":[{"type":"print","value":"9780817647889"},{"type":"electronic","value":"9780817647896"}],"license":[{"start":{"date-parts":[[2010,9,16]],"date-time":"2010-09-16T00:00:00Z","timestamp":1284595200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2010,9,16]],"date-time":"2010-09-16T00:00:00Z","timestamp":1284595200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-0-8176-4789-6_4","type":"book-chapter","created":{"date-parts":[[2010,10,14]],"date-time":"2010-10-14T07:42:50Z","timestamp":1287042170000},"page":"73-104","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Domination in Graphs"],"prefix":"10.1007","author":[{"given":"Nawarat","family":"Ananchuen","sequence":"first","affiliation":[]},{"given":"Watcharaphong","family":"Ananchuen","sequence":"additional","affiliation":[]},{"given":"Michael D.","family":"Plummer","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2010,9,16]]},"reference":[{"key":"4_CR1_4","doi-asserted-by":"crossref","first-page":"3041","DOI":"10.12988\/imf.2007.07277","volume":"2","author":"N Ananchuen","year":"2007","unstructured":"Ananchuen N (2007) On domination critical graphs with cutvertices having connected domination number 3. Int Math Forum 2:3041\u20133052","journal-title":"Int Math Forum"},{"key":"4_CR2_4","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1016\/S0012-365X(03)00179-1","volume":"272","author":"N Ananchuen","year":"2003","unstructured":"Ananchuen N, Plummer MD (2003) Some results related to the toughness of 3-domination critical graphs. Discrete Math 272:5\u201315","journal-title":"Discrete Math"},{"key":"4_CR3_4","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0012-365X(03)00243-7","volume":"277","author":"N Ananchuen","year":"2004","unstructured":"Ananchuen N, Plummer MD (2004) Matching properties in domination critical graphs. Discrete Math 277:1\u201313","journal-title":"Discrete Math"},{"key":"4_CR4_4","doi-asserted-by":"publisher","first-page":"210","DOI":"10.1002\/net.20065","volume":"45","author":"N Ananchuen","year":"2005","unstructured":"Ananchuen N, Plummer MD (2005) Matching in 3-vertex-critical graphs: the even case. Networks 45:210\u2013213","journal-title":"Networks"},{"key":"4_CR5_4","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1016\/j.disc.2005.12.014","volume":"306","author":"N Ananchuen","year":"2006","unstructured":"Ananchuen N, Plummer MD (2006) Erratum to: Matching properties in domination critical graphs. Discrete Math 306:291\u2013291","journal-title":"Discrete Math"},{"key":"4_CR6_4","doi-asserted-by":"publisher","first-page":"292","DOI":"10.1016\/j.disc.2005.12.015","volume":"306","author":"N Ananchuen","year":"2006","unstructured":"Ananchuen N, Plummer MD (2006) Erratum to: Some results related to the toughness of 3-domination critical graphs. Discrete Math 306:292","journal-title":"Discrete Math"},{"key":"4_CR7_4","first-page":"85","volume":"69","author":"N Ananchuen","year":"2006","unstructured":"Ananchuen N, Plummer MD (2006) On the connectivity and matchings in 3-vertex-critical claw-free graphs. Utilitas Math 69:85\u201396","journal-title":"Utilitas Math"},{"key":"4_CR8_4","first-page":"11","volume":"70","author":"N Ananchuen","year":"2006","unstructured":"Ananchuen N, Plummer MD (2006) Some results related to the toughness of 3-domination critical graphs II. Utilitas Math 70:11\u201332","journal-title":"Utilitas Math"},{"key":"4_CR9_4","doi-asserted-by":"publisher","first-page":"1651","DOI":"10.1016\/j.disc.2006.09.015","volume":"307","author":"N Ananchuen","year":"2007","unstructured":"Ananchuen N, Plummer MD (2007) Matchings in 3-vertex-critical graphs: the odd case. Discrete Math 307:1651\u20131658","journal-title":"Discrete Math"},{"key":"4_CR10_4","doi-asserted-by":"publisher","first-page":"3006","DOI":"10.1016\/j.disc.2007.03.012","volume":"307","author":"N Ananchuen","year":"2007","unstructured":"Ananchuen N, Plummer MD (2007) 3-Factor-criticality in domination critical graphs. Discrete Math 307:3006\u20133015","journal-title":"Discrete Math"},{"key":"4_CR11_4","doi-asserted-by":"publisher","first-page":"1260","DOI":"10.1016\/j.disc.2007.03.073","volume":"308","author":"N Ananchuen","year":"2008","unstructured":"Ananchuen N, Ananchuen W, Plummer MD (2008a) Matching properties in connected domination critical graphs. Discrete Math 308:1260\u20131267","journal-title":"Discrete Math"},{"key":"4_CR12_4","unstructured":"Ananchuen W, Ananchuen N, Plummer MD (2008b) Vertex criticality for connected domination. Utilitas Math (to appear)"},{"key":"4_CR13_4","unstructured":"Ananchuen W, Ananchuen N, Plummer MD (2008c) Connected domination: vertex criticality and matchings, (submitted) (to appear)"},{"key":"4_CR14_4","volume-title":"Independent domination critical graphs","author":"S Ao","year":"1994","unstructured":"Ao S (1994) Independent domination critical graphs. M.Sc. thesis, Department of Mathematics and Statistics, University of Victoria"},{"key":"4_CR15_4","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1002\/jgt.20000","volume":"46","author":"D Archdeacon","year":"2004","unstructured":"Archdeacon D et al. (2004) Some remarks on domination. J Graph Theory 46:207\u2013210","journal-title":"J Graph Theory"},{"key":"4_CR16_4","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0012-365X(99)00251-4","volume":"216","author":"X Baogen","year":"2000","unstructured":"Baogen X, Cockayne EJ, Haynes TW, Hedetniemi ST, Shangchao Z (2000) Extremal graphs for inequalities involving domination parameters. Discrete Math 216:1\u201310","journal-title":"Discrete Math"},{"key":"4_CR17_4","volume-title":"Graphs and hypergraphs","author":"C Berge","year":"1973","unstructured":"Berge C (1973) Graphs and hypergraphs. North-Holland, Amsterdam"},{"key":"4_CR18_4","unstructured":"Blitch PM (1983) Domination in graphs. Ph.D. thesis, Department of Mathematics and Statistics, University of South Carolina"},{"key":"4_CR19_4","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1016\/0012-365X(95)00088-E","volume":"159","author":"C Bo","year":"1996","unstructured":"Bo C, Liu B (1996) Some inequalities about connected domination number. Discrete Math 159:241\u2013245","journal-title":"Discrete Math"},{"key":"4_CR20_4","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1002\/jgt.3190030306","volume":"3","author":"B Bollob\u00e1s","year":"1979","unstructured":"Bollob\u00e1s B, Cockayne EJ (1979) Graph theoretic parameters concerning domination, independence and irredundance. J Graph Theory 3:241\u2013250","journal-title":"J Graph Theory"},{"key":"4_CR21_4","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1016\/0012-365X(76)90078-9","volume":"15","author":"JA Bondy","year":"1976","unstructured":"Bondy JA, Chv\u00e1tal V (1976) A method in graph theory. Discrete Math 15:111\u2013135","journal-title":"Discrete Math"},{"key":"4_CR22_4","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-349-03521-2","volume-title":"Graph theory with applications","author":"JA Bondy","year":"1976","unstructured":"Bondy JA, Murty USR (1976) Graph theory with applications. Macmillan, London"},{"key":"4_CR23_4","first-page":"81","volume":"34","author":"RC Brigham","year":"2000","unstructured":"Brigham RC, Carrington JR, Vitray RP (2000) Connected graphs with maximum total domination number. J Combin Math Combin Comput 34:81\u201396","journal-title":"J Combin Math Combin Comput"},{"key":"4_CR24_4","unstructured":"Brigham RC, Chinn PZ, Dutton RD (1984) A study of vertex domination critical graphs. Tech. Report M-2, Department of Mathematics, University of Central Florida"},{"key":"4_CR25_4","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1002\/net.3230180304","volume":"18","author":"RC Brigham","year":"1988","unstructured":"Brigham RC, Chinn PZ, Dutton RD (1988) Vertex domination-critical graphs. Networks 18:173\u2013179","journal-title":"Networks"},{"key":"4_CR26_4","doi-asserted-by":"publisher","first-page":"18","DOI":"10.1016\/j.disc.2005.09.013","volume":"305","author":"RC Brigham","year":"2005","unstructured":"Brigham RC, Haynes TW, Henning MA, Rall DF (2005) Bicritical domination. Discrete Math 305:18\u201332","journal-title":"Discrete Math"},{"key":"4_CR27_4","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1016\/j.disc.2005.06.029","volume":"306","author":"T Burton","year":"2006","unstructured":"Burton T, Sumner DP (2006) Domination dot-critical graphs. Discrete Math 306:11\u201318","journal-title":"Discrete Math"},{"key":"4_CR28_4","doi-asserted-by":"publisher","first-page":"683","DOI":"10.1016\/j.disc.2006.02.016","volume":"307","author":"T Burton","year":"2007","unstructured":"Burton T, Sumner DP (2007) \u03b3-Excellent, critically dominated, end-dominated, and dot-critical trees are equivalent. Discrete Math 307:683\u2013693","journal-title":"Discrete Math"},{"key":"4_CR29_4","first-page":"167","volume":"20","author":"Y Caro","year":"1985","unstructured":"Caro Y, Roditty Y (1985) On the vertex-independence number and star decomposition of graphs. Ars Combinatoria 20:167\u2013180","journal-title":"Ars Combinatoria"},{"key":"4_CR30_4","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1155\/S016117129000031X","volume":"13","author":"Y Caro","year":"1990","unstructured":"Caro Y, Roditty Y (1990) A note on the k-domination number of a graph. Int J Math Sci 13:205\u2013206","journal-title":"Int J Math Sci"},{"key":"4_CR31_4","first-page":"339","volume-title":"Handbook of combinatorial optimization","author":"GJ Chang","year":"1998","unstructured":"Chang GJ (1998) Algorithmic aspects of domination in graphs. In: Du D-Z, Pardalos PM (eds) Handbook of combinatorial optimization, vol 3. Kluwer, Boston, pp 339\u2013405"},{"key":"4_CR32_4","doi-asserted-by":"publisher","first-page":"1296","DOI":"10.1016\/j.disc.2007.03.075","volume":"308","author":"Y Chen","year":"2008","unstructured":"Chen Y, Edwin Cheng TC, Ng CT (2008) Hamilton-connectivity of 3-domination critical graphs with \n$$\\alpha = \\delta + 1 \\geq 5$$\n. Discrete Math 308:1296\u20131307","journal-title":"Discrete Math"},{"key":"4_CR33_4","doi-asserted-by":"publisher","first-page":"503","DOI":"10.1016\/S0893-9659(04)90118-8","volume":"17","author":"XG Chen","year":"2004","unstructured":"Chen XG, Sun L, Ma D-X (2004) Connected domination critical graphs. Appl Math Lett 17:503\u2013507","journal-title":"Appl Math Lett"},{"key":"4_CR34_4","doi-asserted-by":"publisher","first-page":"545","DOI":"10.1016\/S0166-218X(02)00387-6","volume":"127","author":"Y Chen","year":"2003","unstructured":"Chen Y, Tian F (2003) A new proof of Wojcicka\u2019s conjecture. Discrete Appl Math 127: 545\u2013554","journal-title":"Discrete Appl Math"},{"key":"4_CR35_4","doi-asserted-by":"publisher","first-page":"76","DOI":"10.1002\/jgt.10015","volume":"39","author":"Y Chen","year":"2002","unstructured":"Chen Y, Tian F, Wei B (2002) Codiameters of 3-connected 3-domination critical graphs. J Graph Theory 39:76\u201385","journal-title":"J Graph Theory"},{"key":"4_CR36_4","first-page":"239","volume":"61","author":"Y Chen","year":"2002","unstructured":"Chen Y, Tian F, Wei B (2002) The 3-domination-critical graphs with toughness one. Utilitas Math 61:239\u2013253","journal-title":"Utilitas Math"},{"key":"4_CR37_4","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0012-365X(02)00876-2","volume":"271","author":"Y Chen","year":"2003","unstructured":"Chen Y, Tian F, Wei B (2003) Hamilton-connectivity of 3-domination-critical graphs with \u03b1 \u2264 \u03b4. Discrete Math 271:1\u201312","journal-title":"Discrete Math"},{"key":"4_CR38_4","doi-asserted-by":"publisher","first-page":"777","DOI":"10.1006\/eujc.2002.0603","volume":"23","author":"Y Chen","year":"2002","unstructured":"Chen Y, Tian F, Zhang Y (2002) Hamilton-connectivity of 3-domination critical graphs with \n$$\\alpha = \\delta + 2$$\n. Eur J Combinator 23:777\u2013784","journal-title":"Eur J Combinator"},{"key":"4_CR39_4","doi-asserted-by":"publisher","first-page":"3241","DOI":"10.1016\/j.disc.2007.06.029","volume":"308","author":"Z Chengye","year":"2008","unstructured":"Chengye Z, Yuansheng Y, Linlin S (2008) Domination dot-critical graphs with no critical vertices. Discrete Math 308:3241\u20133248","journal-title":"Discrete Math"},{"key":"4_CR40_4","first-page":"99","volume":"132","author":"WE Clark","year":"1998","unstructured":"Clark WE, Shekhtman B, Suen S (1998) Upper bounds for the domination number of a graph. Congr Numer 132:99\u2013123","journal-title":"Congr Numer"},{"issue":"4","key":"4_CR41_4","first-page":"3","volume":"7","author":"WE Clark","year":"2000","unstructured":"Clark WE, Suen S (2000) An inequality related to Vizing\u2019s conjecture. Electron J Combinator 7(4):3","journal-title":"Electron J Combinator"},{"key":"4_CR42_4","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1007\/BFb0070371","volume-title":"Theory and applications of graphs in America\u2019s bicentennial year","author":"EJ Cockayne","year":"1978","unstructured":"Cockayne EJ (1978) Domination of undirected graphs \u2013 a survey. In: Alavi, Y., Lick, D.R. (eds) Theory and applications of graphs in America\u2019s bicentennial year. Springer, Berlin, pp 141\u2013147"},{"key":"4_CR43_4","doi-asserted-by":"publisher","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":"4_CR44_4","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1002\/net.3230070305","volume":"7","author":"EJ Cockayne","year":"1977","unstructured":"Cockayne EJ, Hedetniemi ST (1977) Towards a theory of domination in graphs. Networks 7:247\u2013261","journal-title":"Networks"},{"key":"4_CR45_4","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1016\/0012-365X(90)90359-P","volume":"86","author":"CJ Colbourn","year":"1990","unstructured":"Colbourn CJ, Stewart LK (1990) Permutation graphs: connected domination and Steiner trees. Discrete Math 86:179\u2013189","journal-title":"Discrete Math"},{"key":"4_CR46_4","first-page":"137","volume":"2","author":"M Cropper","year":"2005","unstructured":"Cropper M, Greenwell D, Hilton AJW, Kostochka AV (2005) The domination number of cubic Hamiltonian graphs. AKCE Int J Graph Combinator 2:137\u2013144","journal-title":"AKCE Int J Graph Combinator"},{"key":"4_CR47_4","first-page":"81","volume":"185","author":"E DeLaVi\u00f1a","year":"2007","unstructured":"DeLaVi\u00f1a E, Liu Q, Pepper R, Waller B, West DB (2007) Some conjectures of Graffiti.pc on total domination. Congr Numer 185:81\u201395","journal-title":"Congr Numer"},{"key":"4_CR48_4","first-page":"237","volume":"78","author":"M Dorfling","year":"2006","unstructured":"Dorfling M, Goddard W, Henning MA (2006) Domination in planar graphs with small diameter II. Ars Combinatoria 78:237\u2013255","journal-title":"Ars Combinatoria"},{"key":"4_CR49_4","doi-asserted-by":"crossref","unstructured":"Duchet P, Meyniel H (1982) On Hadwiger\u2019s number and the stability number. In: Bollob\u00e1s B (ed) Graph theory. Annals of Discrete Mathematics, vol 13. North-Holland, Amsterdam, pp 71\u201374","DOI":"10.1016\/S0304-0208(08)73549-7"},{"key":"4_CR50_4","doi-asserted-by":"crossref","unstructured":"Duckworth W, Mans B (2002) On the connected domination number of random regular graphs. In: Ibarra OH, Zhang L (eds) Computing and combinatorics. Lecture notes in computer science, vol 2387. Springer, Berlin, pp 210\u2013219","DOI":"10.1007\/3-540-45655-4_24"},{"key":"4_CR51_4","doi-asserted-by":"publisher","first-page":"1067","DOI":"10.1016\/j.disc.2007.11.061","volume":"309","author":"TC Edwin Cheng","year":"2009","unstructured":"Edwin Cheng TC, Chen Y, Ng CT (2009) Codiameters of 3-domination critical graphs with toughness more than one. Discrete Math 309:1067\u20131078","journal-title":"Discrete Math"},{"key":"4_CR52_4","doi-asserted-by":"crossref","first-page":"271","DOI":"10.7151\/dmgt.1054","volume":"17","author":"O Favaron","year":"1997","unstructured":"Favaron O, Flandrin E, Ryj\u00e1c\u0306ek Z (1997) Factor-criticality and matching extension in DCT-graphs. Discuss Math Graph Theory 17:271\u2013278","journal-title":"Discuss Math Graph Theory"},{"key":"4_CR53_4","doi-asserted-by":"publisher","first-page":"447","DOI":"10.1007\/s00373-004-0577-9","volume":"20","author":"O Favaron","year":"2004","unstructured":"Favaron O, Henning MA (2004) Paired-domination in claw-free cubic graphs. Graph Combinator 20:447\u2013456","journal-title":"Graph Combinator"},{"key":"4_CR54_4","doi-asserted-by":"publisher","first-page":"3213","DOI":"10.1016\/j.disc.2007.06.024","volume":"308","author":"O Favaron","year":"2008","unstructured":"Favaron O, Henning MA (2008) Total domination in claw-free graphs with minimum degree 2. Discrete Math 308:3213\u20133219","journal-title":"Discrete Math"},{"key":"4_CR55_4","doi-asserted-by":"publisher","first-page":"3491","DOI":"10.1016\/j.disc.2007.07.007","volume":"308","author":"O Favaron","year":"2008","unstructured":"Favaron O, Henning MA (2008) Bounds on total domination in claw-free cubic graphs. Discrete Math 308:3491\u20133507","journal-title":"Discrete Math"},{"key":"4_CR56_4","first-page":"173","volume-title":"Advances in graph theory","author":"O Favaron","year":"1991","unstructured":"Favaron O, Kratsch D (1991) Ratios of domination parameters. In: Kulli VR (ed) Advances in graph theory. Vishwa, Gulbarga, pp 173\u2013182"},{"key":"4_CR57_4","doi-asserted-by":"publisher","first-page":"723","DOI":"10.1002\/jgt.3190180708","volume":"18","author":"O Favaron","year":"1994","unstructured":"Favaron O, Sumner DP, Wojcicka E (1994) The diameter of domination k-critical graphs. J Graph Theory 18:723\u2013734","journal-title":"J Graph Theory"},{"key":"4_CR58_4","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1002\/(SICI)1097-0118(199707)25:3<173::AID-JGT1>3.0.CO;2-I","volume":"25","author":"O Favaron","year":"1997","unstructured":"Favaron O, Tian F, Zhang L (1997) Independence and hamiltonicity in 3-domination-critical graphs. J Graph Theory 25:173\u2013184","journal-title":"J Graph Theory"},{"key":"4_CR59_4","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1016\/S0012-365X(99)00038-2","volume":"205","author":"E Flandrin","year":"1999","unstructured":"Flandrin E, Tian F, Wei B, Zhang L (1999) Some properties of 3-domination-critical graphs. Discrete Math 205:65\u201376","journal-title":"Discrete Math"},{"key":"4_CR60_4","doi-asserted-by":"publisher","first-page":"639","DOI":"10.1016\/j.disc.2007.12.080","volume":"309","author":"A Frendrup","year":"2009","unstructured":"Frendrup A, Henning MA, Randerath B, Vestergaard PD (2009) An upper bound on the domination number of a graph with minimum degree 2. Discrete Math 309:639\u2013646","journal-title":"Discrete Math"},{"key":"4_CR61_4","doi-asserted-by":"crossref","unstructured":"Fujita S, Kameda T, Yamashita M (1995) A resource assignment problem on graphs. In: Staples J, Eades P, Katoh N, Moffat A (eds) Algorithms and computation. Lecture notes in computer science, vol 1004. Springer, London, pp 418\u2013427","DOI":"10.1007\/BFb0015448"},{"key":"4_CR62_4","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1137\/S0895480196311328","volume":"13","author":"S Fujita","year":"2000","unstructured":"Fujita S, Kameda T, Yamashita M (2000) A study on r-configurations-a resource arrangement problem. SIAM J Discrete Math 13:227\u2013254","journal-title":"SIAM J Discrete Math"},{"key":"4_CR63_4","volume-title":"Domination in vertex and edge critical graphs","author":"J Fulman","year":"1994","unstructured":"Fulman J (1994) Domination in vertex and edge critical graphs. Manuscript, Department of Mathematics, Harvard University"},{"key":"4_CR64_4","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1002\/net.3230250203","volume":"25","author":"J Fulman","year":"1995","unstructured":"Fulman J, Hanson D, MacGillivray G (1995) Vertex domination-critical graphs. Networks 25:41\u201343","journal-title":"Networks"},{"key":"4_CR65_4","volume-title":"Computers and intractability: a guide to the theory of NP-completeness","author":"MR Garey","year":"1979","unstructured":"Garey MR, Johnson DS (1979) Computers and intractability: a guide to the theory of NP-completeness. W.H. Freeman, San Francisco, CA"},{"key":"4_CR66_4","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1016\/j.disc.2004.05.010","volume":"286","author":"W Goddard","year":"2004","unstructured":"Goddard W, Haynes TW, Henning MA, van der Merwe LC (2004) The diameter of total domination vertex critical graphs. Discrete Math 286:255\u2013261","journal-title":"Discrete Math"},{"key":"4_CR67_4","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1002\/jgt.10027","volume":"40","author":"W Goddard","year":"2002","unstructured":"Goddard W, Henning MA (2002) Domination in planar graphs with small diameter. J Graph Theory 40:1\u201325","journal-title":"J Graph Theory"},{"key":"4_CR68_4","first-page":"121","volume":"13","author":"D Hanson","year":"1993","unstructured":"Hanson D (1993) Hamilton closures in domination critical graphs. J Combin Math Combin Comput 13:121\u2013128","journal-title":"J Combin Math Combin Comput"},{"key":"4_CR69_4","first-page":"89","volume":"63","author":"D Hanson","year":"2003","unstructured":"Hanson D, Wang P (2003) A note on extremal total domination edge critical graphs. Utilitas Math 63:89\u201396","journal-title":"Utilitas Math"},{"key":"4_CR70_4","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1016\/j.disc.2007.12.051","volume":"309","author":"J Harant","year":"2009","unstructured":"Harant J, Rautenbach D (2009) Domination in bipartite graphs. Discrete Math 309:113\u2013122","journal-title":"Discrete Math"},{"key":"4_CR71_4","volume-title":"Fundamentals of domination in graphs","author":"TW Haynes","year":"1998","unstructured":"Haynes TW, Hedetniemi ST, Slater PJ (1998) Fundamentals of domination in graphs. Marcel Dekker, New York"},{"volume-title":"Domination in graphs \u2013 advanced topics","year":"1998","key":"4_CR72_4","unstructured":"Haynes TW, Hedetniemi ST, Slater PJ (eds) (1998) Domination in graphs \u2013 advanced topics. Marcel Dekker, New York"},{"key":"4_CR73_4","first-page":"115","volume":"18","author":"TW Haynes","year":"1998","unstructured":"Haynes TW, Henning MA (1998) Domination critical graphs with respect to relative complements. Australas J Combinator 18:115\u2013126","journal-title":"Australas J Combinator"},{"key":"4_CR74_4","first-page":"243","volume":"91","author":"TW Haynes","year":"2009","unstructured":"Haynes TW, Henning MA (2009) Upper bounds on the total domination number. Ars Combinatoria 91:243\u2013256","journal-title":"Ars Combinatoria"},{"key":"4_CR75_4","first-page":"65","volume":"137","author":"TW Haynes","year":"1999","unstructured":"Haynes TW, Phillips JB, Slater PJ (1999) Realizability of (j, t)-critical graphs for sets of values. Congr Numer 137:65\u201375","journal-title":"Congr Numer"},{"key":"4_CR76_4","first-page":"209","volume-title":"Graph theory and combinatorics","author":"ST Hedetniemi","year":"1984","unstructured":"Hedetniemi ST, Laskar R (1984) Connected domination in graphs. In: Bollob\u00e1s B (ed) Graph theory and combinatorics. Academic, London, pp 209\u2013217"},{"key":"4_CR77_4","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1016\/0012-365X(90)90365-O","volume":"86","author":"ST Hedetniemi","year":"1990","unstructured":"Hedetniemi ST, Laskar RC (1990) Bibliography on domination in graphs and some basic definitions of domination parameters. Discrete Math 86:257\u2013277","journal-title":"Discrete Math"},{"key":"4_CR78_4","first-page":"187","volume":"57","author":"A Hellwig","year":"2006","unstructured":"Hellwig A, Volkmann L (2006) Some upper bounds for the domination number. J Combin Math Combin Comput 57:187\u2013209","journal-title":"J Combin Math Combin Comput"},{"key":"4_CR79_4","first-page":"45","volume":"31","author":"MA Henning","year":"1999","unstructured":"Henning MA (1999) A characterisation of graphs with minimum degree 2 and domination number exceeding a third their size. J Combin Math Combin Comput 31:45\u201364","journal-title":"J Combin Math Combin Comput"},{"key":"4_CR80_4","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1002\/1097-0118(200009)35:1<21::AID-JGT3>3.0.CO;2-F","volume":"35","author":"MA Henning","year":"2000","unstructured":"Henning MA (2000) Graphs with large total domination number. J Graph Theory 35:21\u201345","journal-title":"J Graph Theory"},{"key":"4_CR81_4","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1002\/jgt.20082","volume":"49","author":"MA Henning","year":"2005","unstructured":"Henning MA (2005) A linear Vizing-like relation relating the size and total domination number of a graph. J Graph Theory 49:285\u2013290","journal-title":"J Graph Theory"},{"key":"4_CR82_4","doi-asserted-by":"publisher","first-page":"32","DOI":"10.1016\/j.disc.2007.12.044","volume":"309","author":"MA Henning","year":"2009","unstructured":"Henning MA (2009) A survey of selected recent results on total domination in graphs. Discrete Math 309:32\u201363","journal-title":"Discrete Math"},{"key":"4_CR83_4","doi-asserted-by":"publisher","first-page":"2313","DOI":"10.1016\/j.disc.2006.10.024","volume":"308","author":"MA Henning","year":"2008","unstructured":"Henning MA, Kang L, Shan E, Yeo A (2008) On matching and total domination in graphs. Discrete Math 308:2313\u20132318","journal-title":"Discrete Math"},{"key":"4_CR84_4","first-page":"33","volume":"44","author":"MA Henning","year":"2003","unstructured":"Henning MA, Oellermann OR, Swart HC (2003) Distance domination critical graphs. J Combin Math Combin Comput 44:33\u201345","journal-title":"J Combin Math Combin Comput"},{"key":"4_CR85_4","doi-asserted-by":"crossref","first-page":"28","DOI":"10.37236\/1085","volume":"13","author":"MA Henning","year":"2006","unstructured":"Henning MA, Yeo A (2006) Total domination and matching numbers in claw-free graphs. Electron J Combinator 13, # R 59, 28","journal-title":"Electron J Combinator"},{"key":"4_CR86_4","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1007\/s00373-008-0797-5","volume":"24","author":"MA Henning","year":"2008","unstructured":"Henning MA, Yeo A (2008) Total domination in graphs with given girth. Graph Combinator 24:333\u2013348","journal-title":"Graph Combinator"},{"key":"4_CR87_4","doi-asserted-by":"crossref","first-page":"10","DOI":"10.37236\/983","volume":"14","author":"MA Henning","year":"2007","unstructured":"Henning MA, Yeo A (2007) A new upper bound on the total domination number of a graph. Electron J Combinator 14, # R 65, 10","journal-title":"Electron J Combinator"},{"key":"4_CR88_4","first-page":"97","volume":"77","author":"PT Ho","year":"2008","unstructured":"Ho PT (2008) A note on the total domination number. Utilitas Math 77:97\u2013100","journal-title":"Utilitas Math"},{"key":"4_CR89_4","first-page":"39","volume":"26","author":"D Jinquan","year":"1995","unstructured":"Jinquan D (1995) Some results on 3-domination critical graphs. Acta Sci Nat Univ NeiMonggol 26:39\u201342","journal-title":"Acta Sci Nat Univ NeiMonggol"},{"key":"4_CR90_4","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1002\/jgt.20142","volume":"52","author":"K Kawarabayashi","year":"2006","unstructured":"Kawarabayashi K, Plummer MD, Saito A (2006) Domination in a graph with a 2-factor. J Graph Theory 52:1\u20136","journal-title":"J Graph Theory"},{"key":"4_CR91_4","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1137\/0404010","volume":"4","author":"DJ Kleitman","year":"1991","unstructured":"Kleitman DJ, West DB (1991) Spanning trees with many leaves. SIAM J Discrete Math 4: 99\u2013106","journal-title":"SIAM J Discrete Math"},{"key":"4_CR92_4","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1016\/j.disc.2005.07.005","volume":"304","author":"AV Kostochka","year":"2005","unstructured":"Kostochka AV, Stodolsky BY (2005) On domination in connected cubic graphs. Discrete Math 304:45\u201350","journal-title":"Discrete Math"},{"key":"4_CR93_4","doi-asserted-by":"publisher","first-page":"1142","DOI":"10.1016\/j.disc.2007.12.009","volume":"309","author":"AV Kostochka","year":"2009","unstructured":"Kostochka AV, Stodolsky BY (2009) An upper bound on the domination number of n-vertex connected cubic graphs. Discrete Math 309:1142\u20131162","journal-title":"Discrete Math"},{"key":"4_CR94_4","first-page":"223","volume":"72","author":"PCB Lam","year":"2007","unstructured":"Lam PCB, Wei B (2007) On the total domination number of graphs. Utilitas Math 72:223\u2013240","journal-title":"Utilitas Math"},{"key":"4_CR95_4","first-page":"257","volume":"17","author":"M Las Vergnas","year":"1975","unstructured":"Las Vergnas M (1975) A note on matchings in graphs, Colloque sur la Th\u00e9orie des Graphes (Paris, 1974) Cahiers Centre \u00c9tudes Rech Op\u0301er 17:257\u2013260","journal-title":"Cahiers Centre \u00c9tudes Rech Op\u0301er"},{"key":"4_CR96_4","doi-asserted-by":"crossref","unstructured":"Laskar R, Walikar HB (1981) On domination related concepts in graph theory. In: Rao SB (ed) Combinatorics and graph theory. Lecture notes in mathematics, vol 885. Springer, Berlin, pp 308\u2013320","DOI":"10.1007\/BFb0092276"},{"key":"4_CR97_4","volume-title":"Introduction to combinatorial mathematics","author":"CL Liu","year":"1968","unstructured":"Liu CL (1968) Introduction to combinatorial mathematics. McGraw-Hill, New York"},{"key":"4_CR98_4","doi-asserted-by":"publisher","first-page":"889","DOI":"10.1007\/s10587-004-6438-0","volume":"54","author":"H Liu","year":"2004","unstructured":"Liu H, Sun L (2004) On domination number of 4-regular graphs. Czechoslovak Math J 54:889\u2013898","journal-title":"Czechoslovak Math J"},{"key":"4_CR99_4","first-page":"65","volume":"24","author":"G Liu","year":"1998","unstructured":"Liu G, Yu Q (1998) On n-edge-deletable and n-critical graphs. Bull Inst Combinator Appl 24:65\u201372","journal-title":"Bull Inst Combinator Appl"},{"key":"4_CR100_4","series-title":"World Science","first-page":"199","volume-title":"Combinatorics and graph theory\u201995","author":"K Liying","year":"1995","unstructured":"Liying K, Erfang S (1995) On connected domination number of a graph. In: Ku T-H (ed) Combinatorics and graph theory\u201995, vol 1. World Science, River Edge, NJ, pp 199\u2013204"},{"key":"4_CR101_4","unstructured":"Lov\u00e1sz L, Plummer MD (1986) Matching theory. Annals of Discrete Mathematics, vol 29. North-Holland, Amsterdam"},{"key":"4_CR102_4","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1007\/s00373-007-0770-8","volume":"24","author":"C L\u00f6wenstein","year":"2008","unstructured":"L\u00f6wenstein C, Rautenbach D (2008) Domination in graphs of minimum degree at least two and large girth. Graph Combinator 24:37\u201346","journal-title":"Graph Combinator"},{"key":"4_CR103_4","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1002\/(SICI)1097-0118(199607)22:3<213::AID-JGT2>3.0.CO;2-P","volume":"22","author":"G MacGillivray","year":"1996","unstructured":"MacGillivray G, Seyffarth K (1996) Domination numbers of planar graphs. J Graph Theory 22:213\u2013229","journal-title":"J Graph Theory"},{"key":"4_CR104_4","doi-asserted-by":"publisher","first-page":"749","DOI":"10.1002\/jgt.3190130610","volume":"13","author":"W McCuaig","year":"1989","unstructured":"McCuaig W, Shepherd B (1989) Domination in graphs with minimum degree two. J Graph Theory 13:749\u2013762","journal-title":"J Graph Theory"},{"key":"4_CR105_4","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1016\/j.endm.2006.06.015","volume":"24","author":"DA Mojdeh","year":"2006","unstructured":"Mojdeh DA, Rad NJ (2006) On the total domination critical graphs. Electron Notes Discrete Math 24:89\u201392","journal-title":"Electron Notes Discrete Math"},{"key":"4_CR106_4","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1016\/j.exmath.2006.10.001","volume":"25","author":"DA Mojdeh","year":"2007","unstructured":"Mojdeh DA, Rad NJ (2007) On an open problem concerning total domination critical graphs. Expositiones Math 25:175\u2013179","journal-title":"Expositiones Math"},{"key":"4_CR107_4","first-page":"129","volume":"33","author":"L Moodley","year":"2000","unstructured":"Moodley L (2000) Wojcicka\u2019s theorem: complete, consolidated proof. J Combin Math Combin Comput 33:129\u2013179","journal-title":"J Combin Math Combin Comput"},{"key":"4_CR108_4","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1002\/net.3230230108","volume":"23","author":"M Moscarini","year":"1993","unstructured":"Moscarini M (1993) Doubly chordal graphs, Steiner trees, and connected domination. Networks 23:59\u201369","journal-title":"Networks"},{"key":"4_CR109_4","first-page":"119","volume":"135","author":"CM Mynhardt","year":"1998","unstructured":"Mynhardt CM (1998) On two conjectures concerning 3-domination-critical graphs. Congr Numer 135:119\u2013138","journal-title":"Congr Numer"},{"key":"4_CR110_4","first-page":"67","volume":"67","author":"RE Newman-Wolfe","year":"1988","unstructured":"Newman-Wolfe RE, Dutton RD, Brigham RC (1988) Connecting sets in graphs \u2013 a domination related concept. Congr Numer 67:67\u201376","journal-title":"Congr Numer"},{"key":"4_CR111_4","doi-asserted-by":"crossref","unstructured":"Ore O (1962) Theory of graphs. Am Math Soc Colloq Publ 38","DOI":"10.1090\/coll\/038"},{"key":"4_CR112_4","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1002\/net.3230240408","volume":"24","author":"M Paris","year":"1994","unstructured":"Paris M (1994) Note: the diameter of edge domination critical graphs. Networks 24:261\u2013262","journal-title":"Networks"},{"key":"4_CR113_4","first-page":"111","volume":"141","author":"M Paris","year":"1999","unstructured":"Paris M, Sumner DP, Wojcicka E (1999) Edge-domination-critical graphs with cut-vertices. Congr Numer 141:111\u2013117","journal-title":"Congr Numer"},{"key":"4_CR114_4","doi-asserted-by":"publisher","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":"4_CR115_4","first-page":"129","volume":"58","author":"JB Phillips","year":"2000","unstructured":"Phillips JB, Haynes TW (2000) A generalization of domination critical graphs. Utilitas Math 58:129\u2013144","journal-title":"Utilitas Math"},{"key":"4_CR116_4","doi-asserted-by":"publisher","first-page":"2325","DOI":"10.1016\/j.disc.2006.09.055","volume":"308","author":"D Rautenbach","year":"2008","unstructured":"Rautenbach D (2008) A note on domination, girth and minimum degree. Discrete Math 308:2325\u20132329","journal-title":"Discrete Math"},{"key":"4_CR117_4","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1017\/S0963548300002042","volume":"5","author":"B Reed","year":"1996","unstructured":"Reed B (1996) Paths, stars and the number three. Comb Probab Comput 5:277\u2013295","journal-title":"Comb Probab Comput"},{"key":"4_CR118_4","first-page":"607","volume":"13","author":"E Sampathkumar","year":"1979","unstructured":"Sampathkumar E, Walikar HB (1979) The connected domination number of a graph. J Math Phys Sci 13:607\u2013613","journal-title":"J Math Phys Sci"},{"key":"4_CR119_4","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1002\/(SICI)1097-0118(199706)25:2<139::AID-JGT6>3.0.CO;2-N","volume":"25","author":"LA Sanchis","year":"1997","unstructured":"Sanchis LA (1997) Bounds related to domination in graphs with minimum degree two. J Graph Theory 25:139\u2013152","journal-title":"J Graph Theory"},{"key":"4_CR120_4","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1016\/S0012-365X(99)00143-0","volume":"214","author":"LA Sanchis","year":"2000","unstructured":"Sanchis LA (2000) On the number of edges in graphs with a given connected domination number. Discrete Math 214:193\u2013210","journal-title":"Discrete Math"},{"key":"4_CR121_4","doi-asserted-by":"publisher","first-page":"350","DOI":"10.1002\/jgt.20223","volume":"54","author":"E Shan","year":"2007","unstructured":"Shan E, Kang L, Henning MA (2007) Erratum to: A linear Vizing-like relation relating the size and total domination number of a graph. J Graph Theory 54:350\u2013353","journal-title":"J Graph Theory"},{"key":"4_CR122_4","first-page":"175","volume":"75","author":"WC Shiu","year":"2008","unstructured":"Shiu WC, Zhang L-Z (2008) Pancyclism of 3-domination-critical graphs with small minimum degree. Utilitas Math 75:175\u2013192","journal-title":"Utilitas Math"},{"key":"4_CR123_4","unstructured":"Simmons J (2005) Closure operations and hamiltonian properties of independent and total domination critical graphs. Ph.D. thesis, Department of Mathematics and Statistics, University of Victoria"},{"key":"4_CR124_4","doi-asserted-by":"publisher","first-page":"351","DOI":"10.1112\/jlms\/s2-13.2.351","volume":"13","author":"DP Sumner","year":"1976","unstructured":"Sumner DP (1976) 1-Factors and anti-factor sets. J Lond Math Soc 13:351\u2013359","journal-title":"J Lond Math Soc"},{"key":"4_CR125_4","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1016\/0012-365X(90)90347-K","volume":"86","author":"DP Sumner","year":"1990","unstructured":"Sumner DP (1990) Critical concepts in domination. Discrete Math 86:33\u201346","journal-title":"Discrete Math"},{"key":"4_CR126_4","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1016\/0095-8956(83)90007-2","volume":"34","author":"DP Sumner","year":"1983","unstructured":"Sumner DP, Blitch P (1983) Domination critical graphs. J Combin Theory B 34:65\u201376","journal-title":"J Combin Theory B"},{"key":"4_CR127_4","doi-asserted-by":"publisher","first-page":"473","DOI":"10.1007\/s00493-007-2020-3","volume":"27","author":"S Thomass\u00e9","year":"2007","unstructured":"Thomass\u00e9 S, Yeo A (2007) Total domination of graphs and small transverals of hypergraphs. Combinatorica 27:473\u2013487","journal-title":"Combinatorica"},{"key":"4_CR128_4","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1016\/S0166-218X(98)00149-8","volume":"92","author":"F Tian","year":"1999","unstructured":"Tian F, Wei B, Zhang L (1999) Hamiltonicity in 3-domination-critical graphs with \n$$\\alpha = \\delta + 2$$\n. Discrete Appl Math 92:57\u201370","journal-title":"Discrete Appl Math"},{"key":"4_CR129_4","doi-asserted-by":"publisher","first-page":"416","DOI":"10.1016\/j.aml.2007.05.013","volume":"21","author":"F Tian","year":"2008","unstructured":"Tian F, Xu J-M (2008) Distance domination-critical graphs. Appl Math Lett 21:416\u2013420","journal-title":"Appl Math Lett"},{"key":"4_CR130_4","first-page":"229","volume":"54","author":"LC van der Merwe","year":"1998","unstructured":"van der Merwe LC, Mynhardt CM, Haynes TW (1998) Total domination edge critical graphs. Utilitas Math 54:229\u2013240","journal-title":"Utilitas Math"},{"key":"4_CR131_4","first-page":"67","volume":"131","author":"LC van der Merwe","year":"1998","unstructured":"van der Merwe LC, Mynhardt CM, Haynes TW (1998) Criticality index of total domination. Congr Numer 131:67\u201373","journal-title":"Congr Numer"},{"key":"4_CR132_4","first-page":"85","volume":"27","author":"LC van der Merwe","year":"1999","unstructured":"van der Merwe LC, Mynhardt CM, Haynes TW (1999) 3-domination critical graphs with arbitrary independent domination numbers. Bull ICA 27:85\u201388","journal-title":"Bull ICA"},{"key":"4_CR133_4","doi-asserted-by":"crossref","first-page":"187","DOI":"10.7151\/dmgt.1143","volume":"21","author":"LC van der Merwe","year":"2001","unstructured":"van der Merwe LC, Mynhardt CM, Haynes TW (2001) Total domination edge critical graphs with maximum diameter. Discuss Math Graph Theory 21:187\u2013205","journal-title":"Discuss Math Graph Theory"},{"key":"4_CR134_4","first-page":"79","volume":"66","author":"LC van der Merwe","year":"2003","unstructured":"van der Merwe LC, Mynhardt CM, Haynes TW (2003) Total domination edge critical graphs with minimum diameter. Ars Combinatoria 66:79\u201396","journal-title":"Ars Combinatoria"},{"key":"4_CR135_4","first-page":"117","volume":"23","author":"VG Vizing","year":"1968","unstructured":"Vizing VG (1968) Some unsolved problems in graph theory. Uspekhi Mat Nauk 23:117\u2013134","journal-title":"Uspekhi Mat Nauk"},{"key":"4_CR136_4","doi-asserted-by":"publisher","first-page":"991","DOI":"10.1016\/j.disc.2008.01.015","volume":"309","author":"C Wang","year":"2009","unstructured":"Wang C, Hu Z, Li X (2009) A constructive characterization of total domination vertex critical graphs. Discrete Math 309:991\u2013996","journal-title":"Discrete Math"},{"key":"4_CR137_4","doi-asserted-by":"publisher","first-page":"1079","DOI":"10.1016\/j.disc.2007.11.062","volume":"309","author":"T Wang","year":"2009","unstructured":"Wang T, Yu Q (2009) Factor-critical property in 3-dominating-critical graphs. Discrete Math 309:1079\u20131083","journal-title":"Discrete Math"},{"key":"4_CR138_4","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1002\/net.3230150109","volume":"15","author":"K White","year":"1985","unstructured":"White K, Farber M, Pulleyblank W (1985) Steiner trees, connected domination and strongly chordal graphs. Networks 15:109\u2013124","journal-title":"Networks"},{"key":"4_CR139_4","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1002\/jgt.3190140209","volume":"14","author":"E Wojcicka","year":"1990","unstructured":"Wojcicka E (1990) Hamiltonian properties of domination-critical graphs. J Graph Theory 14:205\u2013215","journal-title":"J Graph Theory"},{"key":"4_CR140_4","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1007\/s00373-006-0638-3","volume":"22","author":"H-M Xing","year":"2006","unstructured":"Xing H-M, Sun L, Chen X-G (2006) Domination in graphs of minimum degree five. Graph Combinator 22:127\u2013143","journal-title":"Graph Combinator"},{"key":"4_CR141_4","first-page":"58","volume":"27","author":"Y Xue","year":"1991","unstructured":"Xue Y, Chen Z (1991) Hamiltonian cycles in domination-critical graphs. J Nanjing Univ 27:58\u201362","journal-title":"J Nanjing Univ"},{"key":"4_CR142_4","doi-asserted-by":"publisher","first-page":"316","DOI":"10.1002\/jgt.20114","volume":"50","author":"Y Yuansheng","year":"2005","unstructured":"Yuansheng Y, Chengye Z, Xiaohui L, Yongsong J, Xin H (2005) Some 3-connected 4-edge-critical non-Hamiltonian graphs. J Graph Theory 50:316\u2013320","journal-title":"J Graph Theory"},{"key":"4_CR143_4","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1016\/S0012-365X(02)00383-7","volume":"259","author":"L-Z Zhang","year":"2002","unstructured":"Zhang L-Z, Tian F (2002) Independence and connectivity in 3-domination-critical graphs. Discrete Math 259:227\u2013236","journal-title":"Discrete Math"},{"key":"4_CR144_4","doi-asserted-by":"publisher","first-page":"1016","DOI":"10.1016\/j.disc.2005.11.047","volume":"307","author":"M Zwierzchowski","year":"2007","unstructured":"Zwierzchowski M (2007) Total domination number of the conjunction of graphs. Discrete Math 307:1016\u20131020","journal-title":"Discrete Math"}],"container-title":["Structural Analysis of Complex Networks"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-0-8176-4789-6_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,18]],"date-time":"2023-02-18T02:35:19Z","timestamp":1676687719000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-0-8176-4789-6_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,9,16]]},"ISBN":["9780817647889","9780817647896"],"references-count":144,"URL":"https:\/\/doi.org\/10.1007\/978-0-8176-4789-6_4","relation":{},"subject":[],"published":{"date-parts":[[2010,9,16]]},"assertion":[{"value":"16 September 2010","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}