{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T17:02:47Z","timestamp":1743094967010,"version":"3.40.3"},"publisher-location":"Cham","reference-count":18,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030250041"},{"type":"electronic","value":"9783030250058"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-25005-8_1","type":"book-chapter","created":{"date-parts":[[2019,7,14]],"date-time":"2019-07-14T23:02:23Z","timestamp":1563145343000},"page":"1-9","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["A Note on Handicap Incomplete Tournaments"],"prefix":"10.1007","author":[{"given":"Appattu Vallapil","family":"Prajeesh","sequence":"first","affiliation":[]},{"given":"Krishnan","family":"Paramasivam","sequence":"additional","affiliation":[]},{"given":"Nainarraj","family":"Kamatchi","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,7,10]]},"reference":[{"key":"1_CR1","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-84628-970-5","volume-title":"Graph Theory","author":"JA Bondy","year":"2008","unstructured":"Bondy, J.A., Murty, U.S.R.: Graph Theory. Springer, New York (2008)"},{"key":"1_CR2","doi-asserted-by":"publisher","DOI":"10.1201\/b10959","volume-title":"Handbook of Product Graphs","author":"R Hammack","year":"2011","unstructured":"Hammack, R., Imrich, W., Klav\u017ear, S.: Handbook of Product Graphs. CRC Press, Boca Raton (2011)"},{"key":"1_CR3","unstructured":"Sedl\u00e1\u010dek, J.: Problem 27. Theory of graphs and its applications. (Smolenice 1963), pp. 163\u2013164. Publication House of the Czechoslovak Academy of Sciences, Prague (1964)"},{"key":"1_CR4","volume-title":"The CRC Handbook of Combinatorial Designs","author":"C Colbourn","year":"2007","unstructured":"Colbourn, C., Dinitz, J.: The CRC Handbook of Combinatorial Designs. CRC Press, Boca Raton (2007)"},{"key":"1_CR5","doi-asserted-by":"publisher","first-page":"562","DOI":"10.1109\/PROC.1977.10517","volume":"65","author":"GS Bloom","year":"1977","unstructured":"Bloom, G.S., Golomb, S.W.: Applications of numbered undirected graphs. Proc. IEEE 65, 562\u2013570 (1977)","journal-title":"Proc. IEEE"},{"key":"1_CR6","series-title":"Lecture Notes in Mathematics","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1007\/BFb0070364","volume-title":"Theory and Applications of Graphs","author":"GS Bloom","year":"1978","unstructured":"Bloom, G.S., Golomb, S.W.: Numbered complete graphs, unusual rulers, and assorted applications. In: Alavi, Y., Lick, D.R. (eds.) Theory and Applications of Graphs. Lecture Notes in Mathematics, vol. 642, pp. 53\u201365. Springer, Berlin (1978). https:\/\/doi.org\/10.1007\/BFb0070364"},{"key":"1_CR7","first-page":"31","volume":"48","author":"D Froncek","year":"2006","unstructured":"Froncek, D., Kov\u00e1r, P., Kov\u00e1rov\u00e1, T.: Fair incomplete tournaments. Bull. Inst. Comb. Appl. 48, 31\u201333 (2006)","journal-title":"Bull. Inst. Comb. Appl."},{"key":"1_CR8","unstructured":"Froncek, D.: Fair incomplete tournaments with odd number of teams and large number of games. In: Proceedings of the Thirty-Eighth Southeastern International Conference on Combinatorics, Graph Theory and Computing. Congr. Numer. 187, 83\u201389 (2007)"},{"key":"1_CR9","unstructured":"Vilfred, V.: $$\\sum -$$labelled graphs and circulant graphs. Ph.D. thesis, University of Kerala, Trivandrum, India (1994)"},{"key":"1_CR10","first-page":"305","volume":"28","author":"M Miller","year":"2003","unstructured":"Miller, M., Rodger, C., Simanjuntak, R.: Distance magic labelings of graphs. Australas. J. Comb. 28, 305\u2013315 (2003)","journal-title":"Australas. J. Comb."},{"key":"1_CR11","doi-asserted-by":"crossref","unstructured":"Arumugam, S., Froncek, D., Kamatchi, N.: Distance magic graphs-a survey. J. Indones. Math. Soc. Special Edition 11\u201326 (2011)","DOI":"10.22342\/jims.0.0.15.11-26"},{"key":"1_CR12","first-page":"119","volume":"10","author":"D Froncek","year":"2013","unstructured":"Froncek, D.: Handicap distance antimagic graphs and incomplete tournaments. AKCE J. Graphs Comb. 10, 119\u2013127 (2013)","journal-title":"AKCE J. Graphs Comb."},{"key":"1_CR13","unstructured":"Freyberg, B.: Distance magic-type and distance antimagic-type labelings of graphs. Ph.D. thesis, Michigan Technological University, Houghton, MI, USA (2017)"},{"key":"1_CR14","doi-asserted-by":"crossref","unstructured":"Kov\u00e1r, P., Kov\u00e1rov\u00e1, T., Krajc, B., Krav\u010denko, M., Shepanik, A., Silber, A.: On regular handicap graphs of even order. In: 9th International Workshop on Graph Labelings (IWOGL 2016). Electron. Notes Discrete Math. 60, 69\u201376 (2017)","DOI":"10.1016\/j.endm.2017.06.010"},{"key":"1_CR15","first-page":"253","volume":"102","author":"D Froncek","year":"2017","unstructured":"Froncek, D.: Regular handicap graphs of odd order. J. Comb. Math. Comb. Comput. 102, 253\u2013266 (2017)","journal-title":"J. Comb. Math. Comb. Comput."},{"key":"1_CR16","first-page":"93","volume":"217","author":"D Froncek","year":"2013","unstructured":"Froncek, D.: Incomplete tournaments and handicap distance antimagic graphs. Congr. Numer. 217, 93\u201399 (2013)","journal-title":"Congr. Numer."},{"key":"1_CR17","first-page":"175","volume":"106","author":"D Froncek","year":"2018","unstructured":"Froncek, D.: Full spectrum of regular incomplete 2-handicap tournaments of order $$n\\equiv 0(mod16)$$. J. Comb. Math. Comb. Comput. 106, 175\u2013184 (2018)","journal-title":"J. Comb. Math. Comb. Comput."},{"key":"1_CR18","doi-asserted-by":"publisher","first-page":"557","DOI":"10.7494\/OpMath.2017.37.4.557","volume":"37","author":"D Froncek","year":"2017","unstructured":"Froncek, D.: A note on incomplete regular tournaments with handicap two of order $$n\\equiv 8(mod16)$$. Opusc. Math. 37, 557\u2013566 (2017)","journal-title":"Opusc. Math."}],"container-title":["Lecture Notes in Computer Science","Combinatorial Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-25005-8_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,13]],"date-time":"2024-03-13T17:12:25Z","timestamp":1710349945000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-25005-8_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030250041","9783030250058"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-25005-8_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"10 July 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"IWOCA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on Combinatorial Algorithms","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Pisa","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23 July 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25 July 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"iwoca2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/iwoca2019.di.unipi.it\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"73","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"36","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"49% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"5-6","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}