Shinde, N. V.; Waphare, B. N. Improved upper bounds for identifying codes in \(n\)-dimensional \(q\)-ary cubes. (English) Zbl 1453.05095 Int. J. Appl. Comput. Math. 6, No. 2, Paper No. 43, 11 p. (2020). MSC: 05C69 05C76 94B60 PDF BibTeX XML Cite \textit{N. V. Shinde} and \textit{B. N. Waphare}, Int. J. Appl. Comput. Math. 6, No. 2, Paper No. 43, 11 p. (2020; Zbl 1453.05095) Full Text: DOI
Martínez-Bernal, José; Valencia-Bucio, Miguel A.; Villarreal, Rafael H. Linear codes over signed graphs. (English) Zbl 1452.94117 Des. Codes Cryptography 88, No. 2, 273-296 (2020). Reviewer: Jorge Neves (Coimbra) MSC: 94B05 94C15 05C40 05C22 13P25 PDF BibTeX XML Cite \textit{J. Martínez-Bernal} et al., Des. Codes Cryptography 88, No. 2, 273--296 (2020; Zbl 1452.94117) Full Text: DOI
Lu, Mei; Xu, Jiale; Zhang, Yi Identifying codes in the direct product of a complete graph and some special graphs. (English) Zbl 1404.05182 Discrete Appl. Math. 254, 175-182 (2019). MSC: 05C76 94B99 PDF BibTeX XML Cite \textit{M. Lu} et al., Discrete Appl. Math. 254, 175--182 (2019; Zbl 1404.05182) Full Text: DOI
Shao, Zehui; Vesel, Aleksander; Xu, Jin The \(k\)-distance independence number and 2-distance chromatic number of Cartesian products of cycles. (English) Zbl 1393.05202 Bull. Malays. Math. Sci. Soc. (2) 41, No. 3, 1377-1391 (2018). MSC: 05C69 05C15 05C76 05C85 PDF BibTeX XML Cite \textit{Z. Shao} et al., Bull. Malays. Math. Sci. Soc. (2) 41, No. 3, 1377--1391 (2018; Zbl 1393.05202) Full Text: DOI
Anderson, Loren Edge Grundy numbers of \(P_3\square P_n\) and \(P_3\square C_n\). (English) Zbl 1397.05054 Int. J. Math. Comput. Sci. 11, No. 1, 33-42 (2016). MSC: 05C15 68R10 PDF BibTeX XML Cite \textit{L. Anderson}, Int. J. Math. Comput. Sci. 11, No. 1, 33--42 (2016; Zbl 1397.05054) Full Text: Link
Bykov, I. S. On locally balanced Gray codes. (Russian, English) Zbl 1349.94152 Diskretn. Anal. Issled. Oper. 23, No. 1, 51-64 (2016); translation in J. Appl. Ind. Math. 10, No. 1, 78-85 (2016). MSC: 94B15 94B25 05C45 PDF BibTeX XML Cite \textit{I. S. Bykov}, Diskretn. Anal. Issled. Oper. 23, No. 1, 51--64 (2016; Zbl 1349.94152); translation in J. Appl. Ind. Math. 10, No. 1, 78--85 (2016) Full Text: DOI
Alahmadi, A.; Aldred, R. E. L.; de la Cruz, R.; Ok, S.; Solé, P.; Thomassen, C. The minimum number of minimal codewords in an \([n, k]\)-code and in graphic codes. (English) Zbl 1311.05027 Discrete Appl. Math. 184, 32-39 (2015). MSC: 05B35 94B25 PDF BibTeX XML Cite \textit{A. Alahmadi} et al., Discrete Appl. Math. 184, 32--39 (2015; Zbl 1311.05027) Full Text: DOI
Alahmadi, A.; Aldred, R. E. L.; de la Cruz, R.; Solé, P.; Thomassen, C. The maximum number of minimal codewords in an \([n,k]\)-code. (English) Zbl 1281.94099 Discrete Math. 313, No. 15, 1569-1574 (2013). MSC: 94B60 05B35 05C30 05C38 PDF BibTeX XML Cite \textit{A. Alahmadi} et al., Discrete Math. 313, No. 15, 1569--1574 (2013; Zbl 1281.94099) Full Text: DOI
Konstantinova, Elena On some structural properties of star and pancake graphs. (English) Zbl 1377.05159 Aydinian, Harout (ed.) et al., Information theory, combinatorics, and search theory. In memory of Rudolf Ahlswede. Berlin: Springer (ISBN 978-3-642-36898-1/pbk). Lecture Notes in Computer Science 7777, 472-487 (2013). MSC: 05C75 05C25 05C38 05C69 PDF BibTeX XML Cite \textit{E. Konstantinova}, Lect. Notes Comput. Sci. 7777, 472--487 (2013; Zbl 1377.05159) Full Text: DOI
Alahmadi, A.; Aldred, R. E. L.; dela Cruz, R.; Solé, P.; Thomassen, C. The maximum number of minimal codewords in long codes. (English) Zbl 1254.05084 Discrete Appl. Math. 161, No. 3, 424-429 (2013). MSC: 05C38 05C35 05B35 94B05 PDF BibTeX XML Cite \textit{A. Alahmadi} et al., Discrete Appl. Math. 161, No. 3, 424--429 (2013; Zbl 1254.05084) Full Text: DOI
Auger, David; Charon, Irène; Hudry, Olivier; Lobstein, Antoine On the existence of a cycle of length at least 7 in a \((1,\leq 2)\)-twin-free graph. (English) Zbl 1217.05116 Discuss. Math., Graph Theory 30, No. 4, 591-609 (2010). MSC: 05C38 05C75 PDF BibTeX XML Cite \textit{D. Auger} et al., Discuss. Math., Graph Theory 30, No. 4, 591--609 (2010; Zbl 1217.05116) Full Text: DOI
Huemer, Clemens; Hurtado, Ferran; Noy, Marc; Omaña-Pulido, Elsa Gray codes for non-crossing partitions and dissections of a convex polygon. (English) Zbl 1168.94519 Discrete Appl. Math. 157, No. 7, 1509-1520 (2009). MSC: 94B25 05A18 05C10 05C45 PDF BibTeX XML Cite \textit{C. Huemer} et al., Discrete Appl. Math. 157, No. 7, 1509--1520 (2009; Zbl 1168.94519) Full Text: DOI
Dejter, Italo J. Perfect domination in regular grid graphs. (English) Zbl 1153.05042 Australas. J. Comb. 42, 99-114 (2008). MSC: 05C69 05C25 94B99 PDF BibTeX XML Cite \textit{I. J. Dejter}, Australas. J. Comb. 42, 99--114 (2008; Zbl 1153.05042) Full Text: arXiv
Klavžar, Sandi Coloring Sierpiński graphs and Sierpiński gasket graphs. (English) Zbl 1154.05032 Taiwanese J. Math. 12, No. 2, 513-522 (2008). MSC: 05C15 05C69 05C45 PDF BibTeX XML Cite \textit{S. Klavžar}, Taiwanese J. Math. 12, No. 2, 513--522 (2008; Zbl 1154.05032) Full Text: DOI
Escuadro, Henry; Okamoto, Futaba; Zhang, Ping Circulants and a three-color conjecture. (English) Zbl 1127.05036 Congr. Numerantium 178, 33-55 (2006). Reviewer: Gabriel Semanišin (Košice) MSC: 05C15 05C38 PDF BibTeX XML Cite \textit{H. Escuadro} et al., Congr. Numerantium 178, 33--55 (2006; Zbl 1127.05036)
Okamoto, Futaba; Radcliffe, Mary; Zhang, Ping On the irregular chromatic number of a graph. (English) Zbl 1127.05043 Congr. Numerantium 181, 129-150 (2006). Reviewer: Gabriel Semanišin (Košice) MSC: 05C15 05C05 05C38 PDF BibTeX XML Cite \textit{F. Okamoto} et al., Congr. Numerantium 181, 129--150 (2006; Zbl 1127.05043)
Enomoto, Hikoe; Katona, Gyula O. H. Pairs of disjoint \(q\)-element subsets far from each other. (English) Zbl 0981.05023 Electron. J. Comb. 8, No. 2, Research Paper R7, 7 p. (2001). MSC: 05B30 05C45 94B99 PDF BibTeX XML Cite \textit{H. Enomoto} and \textit{G. O. H. Katona}, Electron. J. Comb. 8, No. 2, Research paper R7, 7 p. (2001; Zbl 0981.05023) Full Text: EMIS EuDML
Tillich, Jean-Pierre; Zémor, Gilles Optimal cycle codes constructed from Ramanujan graphs. (English) Zbl 0884.05048 SIAM J. Discrete Math. 10, No. 3, 447-459 (1997). MSC: 05C25 11Z05 68R10 94A24 94B25 94B70 05C38 05C80 PDF BibTeX XML Cite \textit{J.-P. Tillich} and \textit{G. Zémor}, SIAM J. Discrete Math. 10, No. 3, 447--459 (1997; Zbl 0884.05048) Full Text: DOI
Solé, Patrick; Zaslavsky, Thomas Maximality of the cycle code of a graph. (English) Zbl 0794.05114 Discrete Math. 128, No. 1-3, 401-405 (1994). Reviewer: G.Gutin (Odense) MSC: 05C75 94C15 05C70 PDF BibTeX XML Cite \textit{P. Solé} and \textit{T. Zaslavsky}, Discrete Math. 128, No. 1--3, 401--405 (1994; Zbl 0794.05114) Full Text: DOI
Compton, Robert C.; Williamson, S. Gill Doubly adjacent Gray codes for the symmetric group. (English) Zbl 0779.94004 Linear Multilinear Algebra 35, No. 3-4, 237-293 (1993). MSC: 94B60 20B30 05C25 PDF BibTeX XML Cite \textit{R. C. Compton} and \textit{S. G. Williamson}, Linear Multilinear Algebra 35, No. 3--4, 237--293 (1993; Zbl 0779.94004) Full Text: DOI
Pevzner, Pavel DNA physical mapping, flows in networks and minimum cycles mean in graphs. (English) Zbl 0784.92013 Gindikin, Simon (ed.), Mathematical methods of analysis of biopolymer sequences. Transl. from the Russian by Oksana Khleborodova. Providence, RI: American Mathematical Society. DIMACS, Ser. Discret. Math. Theor. Comput. Sci. 8, 99-112 (1992). MSC: 92C40 90C35 05C38 90C27 05C90 92-04 90B10 PDF BibTeX XML Cite \textit{P. Pevzner}, in: Mathematical methods of analysis of biopolymer sequences. Transl. from the Russian by Oksana Khleborodova. Providence, RI: American Mathematical Society. 99--112 (1992; Zbl 0784.92013)
Pelc, Andrzej; Rival, Ivan Orders with level diagrams. (English) Zbl 0721.06002 Eur. J. Comb. 12, No. 1, 61-68 (1991). Reviewer: K.Engel (Rostock) MSC: 06A07 06-04 68R10 05C20 68W10 PDF BibTeX XML Cite \textit{A. Pelc} and \textit{I. Rival}, Eur. J. Comb. 12, No. 1, 61--68 (1991; Zbl 0721.06002) Full Text: DOI
Solé, Patrick Covering codes and combinatorial optimization. (English) Zbl 0767.94016 Applied algebra, algebraic algorithms and error-correcting codes, Proc. 9th Int. Symp., AAECC-9, New Orleans/LA (USA) 1991, Lect. Notes Comput. Sci. 539, 426-433 (1991). MSC: 94B25 94B15 PDF BibTeX XML Cite \textit{P. Solé}, Lect. Notes Comput. Sci. 539, 426--433 (1991; Zbl 0767.94016)
Wagner, David G.; West, Julian Construction of uniform Gray codes. (English) Zbl 0735.94011 Numerical mathematics and computing, Proc. 20th Manitoba Conf., Winnipeg/Can. 1990, Congr. Numerantium 80, 217-223 (1991). Reviewer: D.G.Wagner MSC: 94B60 05C45 05C38 PDF BibTeX XML
Ramachandran, Vijaya; Vishkin, Uzi Efficient parallel triconnectivity in logarithmic time. (English) Zbl 0649.68070 VLSI algorithms and architectures, Proc. 3rd Aegean Workshop Comput., Corfu/Greece 1988, Lect. Notes Comput. Sci. 319, 33-42 (1988). MSC: 68R10 68Q25 05-04 05C40 PDF BibTeX XML
Hayward, Ryan B. A lower bound for the optimal crossing-free Hamiltonian cycle problem. (English) Zbl 0623.05037 Discrete Comput. Geom. 2, 327-343 (1987). MSC: 05C45 05C10 05C30 05-04 PDF BibTeX XML Cite \textit{R. B. Hayward}, Discrete Comput. Geom. 2, 327--343 (1987; Zbl 0623.05037) Full Text: DOI EuDML
Walsh, T. R. Generation of nonisomorphic maps on a computer. (English. Russian original) Zbl 0474.05038 Sov. Math., Dokl. 22, 705-709 (1980); translation from Dokl. Akad. Nauk SSSR 255, 301-304 (1980). MSC: 05C30 05-04 05C10 PDF BibTeX XML Cite \textit{T. R. Walsh}, Sov. Math., Dokl. 22, 705--709 (1980; Zbl 0474.05038); translation from Dokl. Akad. Nauk SSSR 255, 301--304 (1980)
Loizou, Georghios On a cycle finding algorithm. (English) Zbl 0444.68056 Inf. Process. Lett. 11, 33-36 (1980). MSC: 68R10 05C38 05C20 05-04 68Q25 68-04 PDF BibTeX XML Cite \textit{G. Loizou}, Inf. Process. Lett. 11, 33--36 (1980; Zbl 0444.68056) Full Text: DOI
Mahr, B.; Perl, J. Gründe, Techniken und Konsequenzen der Verallgemeinerung von Wegalgorithmen. (German) Zbl 0417.05039 Graphen-Sprach. Algorithm. Graphen, 1. Fachtag. graphen-theor. Konz. Inf., Berlin(West) 1975, 131-142 (1976). MSC: 05C38 05-04 PDF BibTeX XML