A generalization of Opsut's result on the competition numbers of line graphs

DOI10.1016/j.dam.2014.10.014zbMath1304.05116OpenAlexW1991427210MaRDI QIDQ479034

Suh-Ryung Kim, Yoshio Sano, Jung Yeun Lee, Boram Park

Publication date: 5 December 2014

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

Full work available at URL: https://doi.org/10.1016/j.dam.2014.10.014

zbMATH Keywords

line graphcompetition graphquasi-line graphdiamond-free graphcompetition numberedge clique coveredge-buffered graphOpsut's conjecture

Mathematics Subject Classification ID

Graph operations (line graphs, products, etc.) (05C76)

Related Items (4)

Niche hypergraphs ⋮ On \((1, 2)\)-step competition graphs of bipartite tournaments ⋮ On the Competition Numbers of Diamond-Free Graphs ⋮ Niche hypergraphs of products of digraphs

Cites Work

• Unnamed Item
• Unnamed Item
• The competition numbers of ternary Hamming graphs
• The (1,2)-step competition graph of a tournament
• A complete characterization of paths that are \(m\)-step competition graphs
• Characterizing paths as \(m\)-step competition graphs
• Competition numbers of complete \(r\)-partite graphs
• Applications of edge coverings by cliques
• Dimension-2 poset competition numbers and dimension-2 poset double competition numbers
• Generalized competition index of a primitive digraph
• On uniquely intersectable graphs
• Transversals and competition numbers of complete multipartite graphs
• Competitively tight graphs
• Food Webs, Competition Graphs, and Habitat Formation
• On the Computation of the Competition Number of a Graph
• Competition Numbers, Quasi-line Graphs, and Holes
• The competition number of a generalized line graph is at most two

This page was built for publication: A generalization of Opsut's result on the competition numbers of line graphs