The elimination procedure for the competition number is not optimal

DOI10.1016/j.dam.2005.11.009zbMath1100.05045OpenAlexW2169318390MaRDI QIDQ2499585

Stephen G. Hartke

Publication date: 14 August 2006

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

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

zbMATH Keywords

competition graphphylogeny graphphylogeny number

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Directed graphs (digraphs), tournaments (05C20)

Related Items (1)

The competition number of a graph whose holes do not overlap much

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A note on perfect Gaussian elimination
• Phylogeny numbers
• Competition numbers of graphs with a small number of triangles
• Triangulated graphs and the elimination process
• The Use of Linear Graphs in Gauss Elimination
• On the Computation of the Competition Number of a Graph

This page was built for publication: The elimination procedure for the competition number is not optimal