Temporary Disabled. :) please Go back Category:Graph theory objects - Wikipedia www.fgks.org » Address: [go: up one dir, main page] Include Form Remove Scripts Accept Cookies Show Images Show Referer Rotate13 Base64 Strip Meta Strip Title Session Cookies Jump to content Main menu Main menu move to sidebar hide Navigation Main pageContentsCurrent eventsRandom articleAbout WikipediaContact usDonate Contribute HelpLearn to editCommunity portalRecent changesUpload file Search Search Appearance Create account Log in Personal tools Create account Log in Pages for logged out editors learn more ContributionsTalk Category:Graph theory objects 10 languages DeutschEspañolفارسیMagyar日本語РусскийSlovenščinaСрпски / srpskiไทยУкраїнська Edit links CategoryTalk English ReadEditView history Tools Tools move to sidebar hide Actions ReadEditView history General What links hereRelated changesUpload fileSpecial pagesPermanent linkPage informationGet shortened URLDownload QR codeWikidata item Print/export Download as PDFPrintable version Appearance move to sidebar hide Help From Wikipedia, the free encyclopedia Structures consisting of sets of edges or vertices in graphs, or additional information on the edges and vertices of graphs. Subcategories This category has the following 2 subcategories, out of 2 total. H Hamiltonian paths and cycles (23 P)S Spanning tree (39 P) Pages in category "Graph theory objects" The following 64 pages are in this category, out of 64 total. This list may not reflect recent changes. ( (a, b)-decompositionA Acyclic orientationB Bipolar orientation Blossom tree (graph theory) Bramble (graph theory)C Chordal completion Clique (graph theory) Clique cover Component (graph theory) Core (graph theory) Cycle (graph theory) Cycle double coverD Directed cycle Dominating setE Ear decomposition Edge cycle cover Edge-graceful labeling End (graph theory) Eternal dominating set Eulerian pathF Feedback arc set Friendly-index setG Graceful labeling Graph center Graph factorizationH Hamiltonian decomposition Hamiltonian path Haven (graph theory) Highway dimension Hydra gameI Incidence (graph) Independent set (graph theory) Induced matching Induced path Induced subgraphL Level structureM Map (graph theory) Maximal independent set Maximum cut Minimum cut Graph minor Modular decomposition Multiple edgesN Neighbourhood (graph theory) NonblockerO Odd cycle transversal Orientation (graph theory)P Path (graph theory) Path cover Peripheral cycle Pfaffian orientation Planar cover PseudoforestR Rainbow matchingS Sachs subgraph Skew partition Split (graph theory) Strong orientationT Tree decomposition Trémaux treeU Unfriendly partition Unique sink orientation Universal vertexW Weak component Category: Graph theory
Structures consisting of sets of edges or vertices in graphs, or additional information on the edges and vertices of graphs.
This category has the following 2 subcategories, out of 2 total.
The following 64 pages are in this category, out of 64 total. This list may not reflect recent changes.