The efficiency of AC graphs

DOI10.1016/0166-218X(93)90227-FzbMath0788.68106OpenAlexW1980302408MaRDI QIDQ686253

Jean R. S. Blair

Publication date: 28 November 1993

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

Full work available at URL: https://doi.org/10.1016/0166-218x(93)90227-f

zbMATH Keywords

maximum efficiency\(AC\) graphsdominated vertex

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Extremal problems in graph theory (05C35) Graph theory (including graph drawing) in computer science (68R10)

Related Items (3)

The scattering number of strictly chordal graphs: linear time determination ⋮ New results on Ptolemaic graphs ⋮ A survey on the Intersection graphs of ideals of rings

Cites Work

• Unnamed Item
• Unnamed Item
• Efficient sets in graphs
• Clique graphs and Helly graphs
• NP-completeness of some generalizations of the maximum matching problem
• On the np-completeness of certain network testing problems

This page was built for publication: The efficiency of AC graphs