A structure theorem for graphs with no cycle with a unique chord and its consequences (Q5189239): Difference between revisions

From MaRDI portal
Created claim: Wikidata QID (P12): Q59903346, #quickstatements; #temporary_batch_1710286856230
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / OpenAlex ID
 
Property / OpenAlex ID: W2952096650 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1309.0979 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of testing for odd holes and induced odd paths / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recognizing Berge graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The three-in-a-tree problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The strong perfect graph theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Even and odd holes in cap-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Balanced matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Structural properties and recognition of restricted and strongly unimodular matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decomposition of Directed Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel Algorithms for Hierarchical Clustering and Applications to Split Decomposition and Parity Graph Recognition / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph Theory and Probability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Map-Colour Theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dividing a Graph into Triconnected Components / rank
 
Normal rank
Property / cites work
 
Property / cites work: Detecting induced subgraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the NP-completeness of the \(k\)-colorability problem for triangle-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for Perfectly Contractile Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4770411 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Vertex colouring and forbidden subgraphs -- a survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Depth-First Search and Linear Graph Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Alpha-balanced graphs and matrices and GF(3)-representability of matroids / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a Class of Totally Unimodular Matrices / rank
 
Normal rank

Latest revision as of 13:56, 2 July 2024

scientific article; zbMATH DE number 5681510
Language Label Description Also known as
English
A structure theorem for graphs with no cycle with a unique chord and its consequences
scientific article; zbMATH DE number 5681510

    Statements

    A structure theorem for graphs with no cycle with a unique chord and its consequences (English)
    0 references
    0 references
    0 references
    15 March 2010
    0 references
    cycle with a unique chord
    0 references
    decomposition
    0 references
    structure
    0 references
    detection
    0 references
    recognition
    0 references
    Heawood graph
    0 references
    Petersen graph
    0 references
    coloring
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references