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

DOI10.1016/J.DAM.2014.10.014zbMATH Open1304.05116OpenAlexW1991427210MaRDI QIDQ479034FDOQ479034

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

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

Recommendations

• On the competition numbers of diamond-free graphs
• The competition number of a generalized line graph is at most two
• scientific article; zbMATH DE number 165080
• Competitively tight graphs
• Competition numbers, quasi-line graphs, and holes

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)

Cites Work

• Title not available (Why is that?)
• The (1,2)-step competition graph of a tournament
• Dimension-2 poset competition numbers and dimension-2 poset double competition numbers
• On uniquely intersectable graphs
• Transversals and competition numbers of complete multipartite graphs
• Food webs, competition graphs, and habitat formation
• Competition numbers, quasi-line graphs, and holes
• The competition number of a generalized line graph is at most two
• The competition numbers of ternary Hamming graphs
• Competition numbers of complete \(r\)-partite graphs
• On the Computation of the Competition Number of a Graph
• Applications of edge coverings by cliques
• Generalized competition index of a primitive digraph
• Competitively tight graphs
• Multicompetition numbers of some multigraphs.
• A complete characterization of paths that are \(m\)-step competition graphs
• Characterizing paths as \(m\)-step competition graphs

Cited In (9)

• Title not available (Why is that?)
• On the competition numbers of diamond-free graphs
• On \((1, 2)\)-step competition graphs of bipartite tournaments
• Niche hypergraphs
• The competition number of a generalized line graph is at most two
• Niche hypergraphs of products of digraphs
• On Opsut's conjecture for hypercompetition numbers of hypergraphs
• Title not available (Why is that?)
• A generalization of Opsut's lower bounds for the competition number of a graph

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q479034)