Competition Graphs of Strongly Connected and Hamiltonian Digraphs

DOI10.1137/S0895480191197234zbMath0830.05035OpenAlexW1992973233MaRDI QIDQ4837645

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

Publication date: 18 January 1996

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

Full work available at URL: https://doi.org/10.1137/s0895480191197234

zbMATH Keywords

cycledigraphchordal graphstrongly connected digraphsinterval graphcommunication networkcompetition graphconflict graphedge clique coverHamiltonian digraphs

Mathematics Subject Classification ID

Communication networks in operations research (90B18) Structural characterization of families of graphs (05C75) Directed graphs (digraphs), tournaments (05C20) Eulerian and Hamiltonian graphs (05C45)

Related Items

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