Representation numbers of complete multipartite graphs

DOI10.1016/j.disc.2011.12.003zbMath1238.05178OpenAlexW1990516048MaRDI QIDQ409453

Dan Pritikin, Anthony B. Evans, Reza Akhtar

Publication date: 13 April 2012

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2011.12.003

zbMATH Keywords

graph representationmultipartite graphprime factorization

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph representations (geometric and intersection representations, etc.) (05C62)

Related Items (5)

Isoperimetry, stability, and irredundance in direct products ⋮ Representations of signed graphs ⋮ Algorithmic complexity of weakly semiregular partitioning and the representation number ⋮ The representation number of some sparse graphs ⋮ Domination parameters of the unitary Cayley graph of \(\mathbb{Z}/n \mathbb{Z} \)

Cites Work

• Representations of disjoint unions of complete graphs
• Representations of graphs modulo \(n\)
• Approximate formulas for some functions of prime numbers
• The Difference Between Consecutive Primes, II
• Representations of graphs and orthogonal latin square graphs
• Representation Numbers of Stars
• Orthogonal latin square graphs
• Representations of graphs modulo n
• On the interval containing at least one prime number
• Unnamed Item
• Unnamed Item

This page was built for publication: Representation numbers of complete multipartite graphs