Dankelmann, Peter; Morgan, Jane; Rivett-Carnac, Emily The oriented diameter of graphs with given connected domination number and distance domination number. (English) Zbl 07805287 Graphs Comb. 40, No. 1, Paper No. 18, 21 p. (2024). MSC: 05C12 05C20 05C69 PDFBibTeX XMLCite \textit{P. Dankelmann} et al., Graphs Comb. 40, No. 1, Paper No. 18, 21 p. (2024; Zbl 07805287) Full Text: DOI OA License
Long, Shude; Ren, Han Upper bounds on the chromatic polynomial of a connected graph with fixed clique number. (English) Zbl 1514.05062 Graphs Comb. 39, No. 3, Paper No. 57, 10 p. (2023). MSC: 05C15 05C07 05C35 PDFBibTeX XMLCite \textit{S. Long} and \textit{H. Ren}, Graphs Comb. 39, No. 3, Paper No. 57, 10 p. (2023; Zbl 1514.05062) Full Text: DOI
Hertz, Alain; Mélot, Hadrien; Bonte, Sébastien; Devillez, Gauvain; Hauweele, Pierre Upper bounds on the average number of colors in the non-equivalent colorings of a graph. (English) Zbl 1518.05064 Graphs Comb. 39, No. 3, Paper No. 49, 22 p. (2023). Reviewer: Tanja Dravec (Maribor) MSC: 05C15 PDFBibTeX XMLCite \textit{A. Hertz} et al., Graphs Comb. 39, No. 3, Paper No. 49, 22 p. (2023; Zbl 1518.05064) Full Text: DOI arXiv
Long, Shude; Ren, Han Mean color numbers of some graphs. (English) Zbl 1481.05050 Graphs Comb. 38, No. 1, Paper No. 14, 13 p. (2022). MSC: 05C15 05C31 PDFBibTeX XMLCite \textit{S. Long} and \textit{H. Ren}, Graphs Comb. 38, No. 1, Paper No. 14, 13 p. (2022; Zbl 1481.05050) Full Text: DOI
Cochran, Garner; Czabarka, Éva; Dankelmann, Peter; Székely, László A size condition for diameter two orientable graphs. (English) Zbl 1459.05061 Graphs Comb. 37, No. 2, 527-544 (2021). MSC: 05C12 05C20 05C35 PDFBibTeX XMLCite \textit{G. Cochran} et al., Graphs Comb. 37, No. 2, 527--544 (2021; Zbl 1459.05061) Full Text: DOI arXiv
Petrovic, Vojislav Kings in bipartite hypertournaments. (English) Zbl 1416.05124 Graphs Comb. 35, No. 4, 913-919 (2019). MSC: 05C20 05C12 PDFBibTeX XMLCite \textit{V. Petrovic}, Graphs Comb. 35, No. 4, 913--919 (2019; Zbl 1416.05124) Full Text: DOI
Mohr, E.; Rautenbach, D. On the maximum number of maximum independent sets. (English) Zbl 1402.05169 Graphs Comb. 34, No. 6, 1729-1740 (2018). MSC: 05C69 05C35 11B39 PDFBibTeX XMLCite \textit{E. Mohr} and \textit{D. Rautenbach}, Graphs Comb. 34, No. 6, 1729--1740 (2018; Zbl 1402.05169) Full Text: DOI arXiv
Brown, Jason I.; Erey, Aysel On the real roots of \(\sigma\)-polynomials. (English) Zbl 1349.05250 Graphs Comb. 32, No. 5, 1723-1730 (2016). MSC: 05C69 05E15 PDFBibTeX XMLCite \textit{J. I. Brown} and \textit{A. Erey}, Graphs Comb. 32, No. 5, 1723--1730 (2016; Zbl 1349.05250) Full Text: DOI arXiv
Tomescu, Ioan; Javed, Sana Extremal bicyclic 3-chromatic graphs. (English) Zbl 1318.05029 Graphs Comb. 31, No. 4, 1043-1052 (2015). MSC: 05C15 05C31 11B73 PDFBibTeX XMLCite \textit{I. Tomescu} and \textit{S. Javed}, Graphs Comb. 31, No. 4, 1043--1052 (2015; Zbl 1318.05029) Full Text: DOI
Koh, Khee M.; Maleki, Zeinab; Omoomi, Behnaz An upper bound for the total restrained domination number of graphs. (English) Zbl 1272.05150 Graphs Comb. 29, No. 5, 1443-1452 (2013). MSC: 05C69 05C70 PDFBibTeX XMLCite \textit{K. M. Koh} et al., Graphs Comb. 29, No. 5, 1443--1452 (2013; Zbl 1272.05150) Full Text: DOI
Morgan, Kerri Pairs of chromatically equivalent graphs. (English) Zbl 1235.05053 Graphs Comb. 27, No. 4, 547-556 (2011). MSC: 05C15 05C31 PDFBibTeX XMLCite \textit{K. Morgan}, Graphs Comb. 27, No. 4, 547--556 (2011; Zbl 1235.05053) Full Text: DOI
Ozeki, Kenta; Yamashita, Tomoki Spanning trees: A survey. (English) Zbl 1232.05055 Graphs Comb. 27, No. 1, 1-26 (2011). Reviewer: Mikhail Ostrovskii (Queens) MSC: 05C05 05-02 05C12 05C45 PDFBibTeX XMLCite \textit{K. Ozeki} and \textit{T. Yamashita}, Graphs Comb. 27, No. 1, 1--26 (2011; Zbl 1232.05055) Full Text: DOI
Tomescu, Ioan; Bokhary, Syed Ahtsham ul Haq Some properties of chromatic coefficients of linear uniform hypergraphs. (English) Zbl 1186.05088 Graphs Comb. 25, No. 4, 639-646 (2009). Reviewer: Benjamin Doerr (Saarbrücken) MSC: 05C65 05C15 PDFBibTeX XMLCite \textit{I. Tomescu} and \textit{S. A. u. H. Bokhary}, Graphs Comb. 25, No. 4, 639--646 (2009; Zbl 1186.05088) Full Text: DOI
Bokhary, S. A.; Tomescu, Ioan; Bhatti, Akhlaq Ahmad On the chromaticity of multi-bridge hypergraphs. (English) Zbl 1213.05065 Graphs Comb. 25, No. 2, 145-152 (2009). MSC: 05C15 05C65 PDFBibTeX XMLCite \textit{S. A. Bokhary} et al., Graphs Comb. 25, No. 2, 145--152 (2009; Zbl 1213.05065) Full Text: DOI
Wood, David R. On the maximum number of cliques in a graph. (English) Zbl 1122.05048 Graphs Comb. 23, No. 3, 337-352 (2007). MSC: 05C35 05C83 PDFBibTeX XMLCite \textit{D. R. Wood}, Graphs Comb. 23, No. 3, 337--352 (2007; Zbl 1122.05048) Full Text: DOI arXiv
Hernández, Santos; Luca, Florian Integer roots chromatic polynomials of non-chordal graphs and the Prouhet-Tarry-Escott problem. (English) Zbl 1075.05035 Graphs Comb. 21, No. 3, 319-323 (2005). MSC: 05C15 11D72 PDFBibTeX XMLCite \textit{S. Hernández} and \textit{F. Luca}, Graphs Comb. 21, No. 3, 319--323 (2005; Zbl 1075.05035) Full Text: DOI
Koh, K. M.; Tan, B. P. The minimum diameter of orientations of complete multipartite graphs. (English) Zbl 0861.05029 Graphs Comb. 12, No. 4, 333-339 (1996). Reviewer: G.Gutin (Odense) MSC: 05C20 05C35 PDFBibTeX XMLCite \textit{K. M. Koh} and \textit{B. P. Tan}, Graphs Comb. 12, No. 4, 333--339 (1996; Zbl 0861.05029) Full Text: DOI
Dong, F. M.; Liu, Y. P. On the chromatic uniqueness of the graph \(W(n,n-2,k)\). (English) Zbl 0857.05039 Graphs Comb. 12, No. 3, 221-230 (1996). Reviewer: A.Huck (Hannover) MSC: 05C15 PDFBibTeX XMLCite \textit{F. M. Dong} and \textit{Y. P. Liu}, Graphs Comb. 12, No. 3, 221--230 (1996; Zbl 0857.05039) Full Text: DOI
Peng, Yee-Hock Another family of chromatically unique graphs. (English) Zbl 0836.05028 Graphs Comb. 11, No. 3, 285-291 (1995). Reviewer: M.Frick (Pretoria) MSC: 05C15 05C60 PDFBibTeX XMLCite \textit{Y.-H. Peng}, Graphs Comb. 11, No. 3, 285--291 (1995; Zbl 0836.05028) Full Text: DOI
Koh, K. M.; Teo, K. L. The search for chromatically unique graphs. (English) Zbl 0727.05023 Graphs Comb. 6, No. 3, 259-285 (1990). Reviewer: I.Tomescu (Bucureşti) MSC: 05C15 05C35 PDFBibTeX XMLCite \textit{K. M. Koh} and \textit{K. L. Teo}, Graphs Comb. 6, No. 3, 259--285 (1990; Zbl 0727.05023) Full Text: DOI
Koh, K. M.; Poh, K. S. On a construction of critical graphs which are not sensitive. (English) Zbl 0575.05048 Graphs Comb. 1, 265-270 (1985). Reviewer: P.Horak MSC: 05C99 05C35 PDFBibTeX XMLCite \textit{K. M. Koh} and \textit{K. S. Poh}, Graphs Comb. 1, 265--270 (1985; Zbl 0575.05048) Full Text: DOI