• 
  

  URI(s)

  • http://id.loc.gov/authorities/subjects/sh85056471
  • info:lc/authorities/sh85056471
  • http://id.loc.gov/authorities/sh85056471#concept

• Instance Of

  • MADS/RDF Topic
  • MADS/RDF Authority
  • SKOS Concept

• Scheme Membership(s)

  • Library of Congress Subject Headings

• Collection Membership(s)

  • LCSH Collection - Authorized Headings
  • LCSH Collection - General Collection

• Variants

  • Graph theory--Extremal problems
  • Graphs, Theory of
  • Theory of graphs

• Broader Terms

  • Combinatorial analysis
  • Topology

• Narrower Terms

  • Bipartite graphs
  • Bond graphs
  • Cayley graphs
  • Closed graph theorems
  • Complete graphs
  • Coxeter graphs
  • Directed graphs
  • Domination (Graph theory)
  • Eulerian graph theory
  • Fuzzy graphs
  • Graph algorithms
  • Graph coloring
  • Graph connectivity
  • Graph grammars
  • Graph labelings
  • Hamiltonian graph theory
  • Hypergraphs
  • Intersection graph theory
  • Labyrinth problems
  • Laplacian matrices
  • Lattice paths
  • Map-coloring problem
  • Paths and cycles (Graph theory)
  • Perfect graphs
  • Petersen graphs
  • Petri nets
  • Quantum graphs
  • Ramsey theory
  • Random graphs
  • Reconstruction (Graph theory)
  • Representations of graphs
  • Topological graph theory
  • Traveling salesman problem
  • Trees (Graph theory)

• Exact Matching Concepts from Other Schemes

  • http://stitch.cs.vu.nl/vocabularies/rameau/ark:/12148/cb119384413

• Closely Matching Concepts from Other Schemes

  • http://d-nb.info/gnd/4113782-6

• Earlier Established Forms

  • Graph theory--Extremal problems

• LC Classification

  • QA166-QA166.245

• Change Notes

  • 1986-02-11: new
  • 2003-03-11: revised

• Alternate Formats

  • RDF/XML (MADS and SKOS)
  • N-Triples (MADS and SKOS)
  • JSON (MADS/RDF and SKOS/RDF)
  • MADS - RDF/XML
  • MADS - N-Triples
  • MADS/RDF - JSON
  • SKOS - RDF/XML
  • SKOS - N-Triples
  • SKOS - JSON
  • MADS/XML
  • MARC/XML

Fields denoted with an asterisk (*) are required.