Competition Graphs of Strongly Connected and Hamiltonian Digraphs

DOI10.1137/S0895480191197234zbMath0830.05035MaRDI QIDQ4837645

J. Richard Lundgren, Sarah K. Merz, John S. Maybee, Norman J. Pullman, Kathryn Fraughnaugh

Publication date: 18 January 1996

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

zbMATH Keywords

cycle; digraph; chordal graph; strongly connected digraphs; interval graph; communication network; competition graph; conflict graph; edge clique cover; Hamiltonian digraphs

Mathematics Subject Classification ID

90B18: Communication networks in operations research

05C75: Structural characterization of families of graphs

05C20: Directed graphs (digraphs), tournaments

05C45: Eulerian and Hamiltonian graphs

Related Items

On CCE graphs of doubly partial orders, Structural properties and hamiltonicity of neighborhood graphs, The \(m\)-step competition graphs of doubly partial orders, The competition hypergraphs of doubly partial orders, A class of acyclic digraphs with interval competition graphs