On algorithms for enumerating BC-subtrees of unicyclic and edge-disjoint bicyclic graphs (Q260059): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q3655116 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Block-cutvertex trees and block-cutvertex partitions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recognizing Some Subclasses of Vertex Intersection Graphs of 0-Bend Paths in a Grid / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3184799 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Block cutpoint decomposition for markovian queueing systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Structure and enumeration of two-connected graphs with prescribed three-connected components / rank
 
Normal rank
Property / cites work
 
Property / cites work: The spectral radius of unicyclic and bicyclic graphs with \(n\) vertices and \(k\) pendant vertices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5555548 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stack and Queue Layouts of Directed Acyclic Graphs: Part II / rank
 
Normal rank
Property / cites work
 
Property / cites work: Degree distance of unicyclic and bicyclic graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Largest Number of Subtrees of Trees with a Given Maximum Degree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5299400 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5299365 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two flow network simplification algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: On trees with a maximum proper partial 0-1 coloring containing a maximum matching / rank
 
Normal rank
Property / cites work
 
Property / cites work: An algorithm for the blocks and cutnodes of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new technique for the characterization of graphs with a maximum number of spanning trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3999466 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On subtrees of trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extremal values of ratios: distance problems vs. subtree problems in trees. II / rank
 
Normal rank
Property / cites work
 
Property / cites work: Unicyclic and bicyclic graphs having minimum degree distance / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extremal trees with given degree sequence for the Randić index / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extremal unicyclic and bicyclic graphs with respect to Harary index / rank
 
Normal rank
Property / cites work
 
Property / cites work: Subtrees of spiro and polyphenyl hexagonal chains / rank
 
Normal rank
Property / cites work
 
Property / cites work: Enumeration of BC-subtrees of trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Enumeration of subtrees of trees / rank
 
Normal rank

Latest revision as of 15:07, 11 July 2024

scientific article
Language Label Description Also known as
English
On algorithms for enumerating BC-subtrees of unicyclic and edge-disjoint bicyclic graphs
scientific article

    Statements

    On algorithms for enumerating BC-subtrees of unicyclic and edge-disjoint bicyclic graphs (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    18 March 2016
    0 references
    block-cutpoint-tree
    0 references
    BC-subtrees
    0 references
    unicyclic graphs
    0 references
    edge-disjoint bicyclic graphs
    0 references
    generating function
    0 references
    enumeration
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

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