A matrix analysis of carrier posets of biconnected graphs (Q4322525): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1080/03081089508818339 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2061691540 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The two basic linear time Planarity algorithms: Are they the same? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4194881 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient Planarity Testing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Planarity and duality of finite and infinite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bridges and Hamiltonian circuits in planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding triconnected components of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Determining outerplanarity using segment graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3997887 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Canonical forms for cycles in bridge graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4552272 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Embedding Graphs in the Plane—Algorithmic Aspects / rank
 
Normal rank

Latest revision as of 11:54, 23 May 2024

scientific article; zbMATH DE number 721071
Language Label Description Also known as
English
A matrix analysis of carrier posets of biconnected graphs
scientific article; zbMATH DE number 721071

    Statements

    A matrix analysis of carrier posets of biconnected graphs (English)
    0 references
    0 references
    9 February 1995
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    poset
    0 references
    broken cycle content functions
    0 references
    matrices
    0 references
    broken cycle content matrix
    0 references
    full span chain
    0 references
    biconnected simple graphs
    0 references
    optimal graph algorithms
    0 references
    0 references