Competition Numbers, Quasi-line Graphs, and Holes

DOI10.1137/110856277zbMath1292.05197arXiv1110.2933OpenAlexW2144422070MaRDI QIDQ4979824

Brendan D. McKay, Pascal Schweitzer, Patrick Schweitzer

Publication date: 19 June 2014

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

Full work available at URL: https://arxiv.org/abs/1110.2933

zbMATH Keywords

characterizationholequasi-line graphcompetition number

Mathematics Subject Classification ID

Structural characterization of families of graphs (05C75) Graph representations (geometric and intersection representations, etc.) (05C62) Graph operations (line graphs, products, etc.) (05C76)

Related Items

Niche hypergraphs ⋮ On \((1, 2)\)-step competition graphs of bipartite tournaments ⋮ On the Competition Numbers of Diamond-Free Graphs ⋮ Competitively tight graphs ⋮ A generalization of Opsut's result on the competition numbers of line graphs ⋮ Niche hypergraphs of products of digraphs