A characterization of graphs with interval two-step graphs

DOI10.1016/0024-3795(94)00173-BzbMATH Open0821.05045MaRDI QIDQ1805321FDOQ1805321

Authors: J. Richard Lundgren, S. K. Merz, John S. Maybee, Craig Rasmussen 

Publication date: 12 September 1995

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

Recommendations

• Two-step graphs of trees
• scientific article
• Interval competition graphs of symmetric digraphs

zbMATH Keywords

girthinterval graphmaximal cliquestwo-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)

Cites Work

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

Cited In (7)

• Two-step graphs of trees
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Structural properties and hamiltonicity of neighborhood graphs
• Title not available (Why is that?)
• Chromatic numbers of competition graphs

This page was built for publication: A characterization of graphs with interval two-step graphs

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