Asteroidal Triple-Free Graphs

From MaRDI portal
Revision as of 01:23, 7 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:4377431


DOI10.1137/S0895480193250125zbMath0884.05075MaRDI QIDQ4377431

Stephan Olariu, Lorna K. Stewart, Derek Gordon Corneil

Publication date: 9 February 1998

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


05C35: Extremal problems in graph theory

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

05C75: Structural characterization of families of graphs


Related Items

On the L(h, k)‐labeling of co‐comparability graphs and circular‐arc graphs, Asteroidal triples of moplexes, Complexity classification of some edge modification problems, Diameter determination on restricted graph families, Tree-decompositions of small pathwidth, Separator orders in interval, cocomparability, and AT-free graphs, Bandwidth on AT-free graphs, Some properties of edge intersection graphs of single-bend paths on a grid, Minimal triangulations of graphs: a survey, Minimal separators in \(P_4\)-sparse graphs, Feedback vertex set on AT-free graphs, Boxicity and cubicity of asteroidal triple free graphs, Efficient algorithms for Roman domination on some classes of graphs, Localized and compact data-structure for comparability graphs, Treelike comparability graphs, Radius versus diameter in cocomparability and intersection graphs, Treewidth for graphs with small chordality, On linear and circular structure of (claw, net)-free graphs, Induced matchings in asteroidal triple-free graphs, Hereditary dominating pair graphs, On stable cutsets in graphs, On claw-free asteroidal triple-free graphs, Recognition and computation of minimal triangulations for AT-free claw-free and co-comparability graphs, On the Steiner, geodetic and hull numbers of graphs, On the domination search number, AT-free graphs: Linear bounds for the oriented diameter, Triangulating graphs without asteroidal triples, Rainbow connections of graphs: a survey, On the vertex ranking problem for trapezoid, circular-arc and other graphs, Domination and total domination on asteroidal triple-free graphs, Pursuing a fast robber on a graph, Classes of perfect graphs, Unnamed Item, Rainbow connection number and connected dominating sets, Approximability of the Path-Distance-Width for AT-free Graphs, Asteroidal Triple of Edges in Bichordal Graphs: A Complete list, Asteroidal Chromatic Number of a Graph