A characterization of graphs with interval two-step graphs

DOI10.1016/0024-3795(94)00173-BzbMath0821.05045MaRDI QIDQ1805321

Craig W. Rasmussen, J. Richard Lundgren, John S. Maybee, Sarah K. Merz

Publication date: 12 September 1995

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

zbMATH Keywords

girthmaximal cliquesinterval graphtwo-step graphGilmore-Hoffman characterization

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Paths and cycles (05C38) Structural characterization of families of graphs (05C75)

Related Items

Structural properties and hamiltonicity of neighborhood graphs, Chromatic numbers of competition graphs

Cites Work

• Interval competition graphs of symmetric digraphs
• Two-step graphs of trees
• \((i,j)\) competition graphs
• Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms
• The square of a chordal graph
• Incidence matrices and interval graphs
• Algorithmic Aspects of Vertex Elimination on Graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item