Graph-Theoretic Concepts in Computer Science
From MaRDI portal
Publication:5902528
DOI10.1007/b93953zbMath1255.05160MaRDI QIDQ5902528
Ji Ping Liu, Haiko Müller, Chuan-Min Lee, Ton Kloks
Publication date: 12 January 2010
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Graph theory (including graph drawing) in computer science (68R10) Structural characterization of families of graphs (05C75) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (15)
Structural results for general partition, equistable and triangle graphs ⋮ On equistable, split, CIS, and related classes of graphs ⋮ Graphs vertex-partitionable into strong cliques ⋮ Equistable simplicial, very well-covered, and line graphs ⋮ Short proofs on the structure of general partition, equistable and triangle graphs ⋮ Bipartite bihypergraphs: a survey and new results ⋮ Improved bottleneck domination algorithms ⋮ On the complexity of the independent set problem in triangle graphs ⋮ Equistable graphs, general partition graphs, triangle graphs, and graph products ⋮ Strong cliques in diamond-free graphs ⋮ Recognizing k-equistable Graphs in FPT Time ⋮ Detecting strong cliques ⋮ Independent Domination in Triangle Graphs ⋮ 1-Triangle graphs and perfect neighborhood sets ⋮ Strong cliques and equistability of EPT graphs
This page was built for publication: Graph-Theoretic Concepts in Computer Science
