Hamiltonicity, diameter, domination, packing, and biclique partitions of Mycielski's graphs
DOI10.1016/S0166-218X(97)00126-1zbMath0906.05043MaRDI QIDQ1392568
David C. Fisher, Patricia A. McKenna, Elizabeth D. Boyer
Publication date: 28 July 1998
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: http://www.elsevier.com/locate/dam
diameteradjacency matrixchromatic numberpacking numberclique numberdomination numberbiclique partition numberMycielski's graphs
Extremal problems in graph theory (05C35) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Coloring of graphs and hypergraphs (05C15) Eulerian and Hamiltonian graphs (05C45)
Related Items (32)
Cites Work
This page was built for publication: Hamiltonicity, diameter, domination, packing, and biclique partitions of Mycielski's graphs