A Survey of the Algorithmic Properties of Simplicial, Upper Bound and Middle Graphs

DOI10.7155/JGAA.00123MaRDI QIDQ5301387zbMATH OpenOpenAlexFDO

Authors Grant A. Cheston, Tjoen Seng Jap

Publication date 19 January 2009

Published in Journal of Graph Algorithms and Applications (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://eudml.org/doc/55398, http://www.emis.de/journals/JGAA/accepted/2006/ChestonYap2006.10.2.pdf

zbMATH Keywords

Efficient algorithms

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Boundary properties of graphs for algorithmic graph problems
• Simplicial decompositions of graphs: A survey of applications
• Bounds and algorithms for graph trusses
• On efficient dominating sets in simplicial graphs
• Algorithms for classes of graphs with bounded expansion
• Efficient algorithms for combinatorial problems on graphs with bounded decomposability - a survey
• A bound for the complexity of a simple graph
• scientific article; zbMATH DE number 3908482
• Approximation algorithms for approximating graphs with bounded number of connected components
• scientific article; zbMATH DE number 4016952

Cited in

(9)

• Equistable simplicial, very well-covered, and line graphs
• On equistable, split, CIS, and related classes of graphs
• On strict-double-bound numbers of caterpillars
• scientific article; zbMATH DE number 4093496 (Why is no real title available?)
• On strict-double-bound numbers of graphs and cut sets
• 1-Triangle graphs and perfect neighborhood sets
• Strong cliques in diamond-free graphs
• On local maximum stable set greedoids
• Dimension-2 poset competition numbers and dimension-2 poset double competition numbers

This page was built for publication: A Survey of the Algorithmic Properties of Simplicial, Upper Bound and Middle Graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5301387)