Publication:3689222

zbMath0572.05050MaRDI QIDQ3689222

Fred S. Roberts, Arundhati Raychaudhuri

Publication date: 1985

zbMATH Keywords

loop; interval graph; recognition problem; generalized competition graph

Mathematics Subject Classification ID

05C99: Graph theory

94C15: Applications of graph theory to circuits and networks

Related Items

Competitive inheritance and limitedness of graphs, Graphs having many holes but with small competition numbers, Interval competition graphs of symmetric digraphs, Two-step graphs of trees, \(p\)-competition numbers, On CCE graphs of doubly partial orders, Characterizations of competition multigraphs, Dimension-2 poset competition numbers and dimension-2 poset double competition numbers, The competition number of a graph whose holes do not overlap much, Niche graphs, \((i,j)\) competition graphs, Phylogeny numbers, Competition numbers of graphs with a small number of triangles, Phylogeny numbers for graphs with two triangles, The \(m\)-step competition graph of a digraph, \(p\)-competition graphs, A characterization of graphs with interval two-step graphs, Chromatic numbers of competition graphs, Any complete preference structure without circuit admits an interval representation, The \(m\)-step competition graphs of doubly partial orders, A class of acyclic digraphs with interval competition graphs, The elimination procedure for the competition number is not optimal, Competition graphs and clique dimensions