Efficient Local Representations of Graphs

DOI10.1007/978-3-319-31940-7_6zbMath1352.05134OpenAlexW2534643277WikidataQ60691753 ScholiaQ60691753MaRDI QIDQ5506777

Edward R. Scheinerman

Publication date: 16 December 2016

Published in: Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-31940-7_6

zbMATH Keywords

hereditary classes of graphs

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Structural characterization of families of graphs (05C75) Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Graph representations (geometric and intersection representations, etc.) (05C62)

Related Items (1)

An adjacency labeling scheme based on a decomposition of trees into caterpillars

Uses Software

• OEIS

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Tolerance graphs
• Characterizing intersection classes of graphs
• String graphs. II: Recognizing string graphs is NP-hard
• String graphs. I: The number of critical nonstring graphs is infinite
• Complement reducible graphs
• Local representations using very short labels
• On the size of hereditary classes of graphs
• The speed of hereditary properties of graphs
• Algorithmic graph theory and perfect graphs
• Threshold graphs and related topics
• Matrix characterizations of circular-arc graphs
• Graph Algorithms
• Representation of a finite graph by a set of intervals on the real line
• Implicat Representation of Graphs
• Topics in Intersection Graph Theory
• Graph Classes: A Survey
• Random Geometric Graphs
• Every planar graph is the intersection graph of segments in the plane
• The Representation of a Graph by Set Intersections
• Topology of Thin Film RC Circuits
• Permutation Graphs and Transitive Graphs
• A Characterization of Comparability Graphs and of Interval Graphs

This page was built for publication: Efficient Local Representations of Graphs