Robust Connectivity of Graphs on Surfaces (Q5084099): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Set OpenAlex properties.
 
(2 intermediate revisions by 2 users not shown)
Property / arXiv ID
 
Property / arXiv ID: 2104.12030 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graphs with homeomorphically irreducible spanning trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Max-leaves spanning tree is APX-hard for cubic graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A 3/2-Approximation Algorithm for Finding Spanning Trees with Many Leaves in Cubic Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4137202 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On acyclic colorings of planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Flexible List Colorings in Graphs with Special Degeneracy Conditions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Homeomorphically Irreducible Spanning Trees in Locally Connected Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Edge‐maximal graphs on orientable and some nonorientable surfaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: Large induced forests in planar graphs with girth 4 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A lower bound on the order of the largest induced linear forest in triangle-free planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Connected dominating set. Theory and applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity ecology of parameters: An illustration using bounded max leaf number / rank
 
Normal rank
Property / cites work
 
Property / cites work: An exact algorithm for the maximum leaf spanning tree problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum feedback vertex set and acyclic coloring. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving connected dominating set faster than \(2^n\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximum and minimum toughness of graphs of small genus / rank
 
Normal rank
Property / cites work
 
Property / cites work: Spanning trees with many leaves in cubic graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Spanning trees in graphs of minimum degree 4 or 5 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4819371 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3971782 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The genus of complete 3-uniform hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4081276 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum size of feedback vertex sets of planar graphs of girth at least five / rank
 
Normal rank
Property / cites work
 
Property / cites work: Spanning Trees with Many Leaves / rank
 
Normal rank
Property / cites work
 
Property / cites work: Below All Subsets for Minimal Connected Dominating Set / rank
 
Normal rank
Property / cites work
 
Property / cites work: Robust Randomized Matchings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Edge-Maximal Graphs on Surfaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2726740 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Large induced forests in triangle-free planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Large Induced Forests in Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constructing full spanning trees for cubic graphs / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W4283011735 / rank
 
Normal rank

Latest revision as of 10:05, 30 July 2024

scientific article; zbMATH DE number 7546788
Language Label Description Also known as
English
Robust Connectivity of Graphs on Surfaces
scientific article; zbMATH DE number 7546788

    Statements

    Robust Connectivity of Graphs on Surfaces (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    23 June 2022
    0 references
    0 references
    0 references
    0 references
    0 references
    robust connectivity
    0 references
    graphs on surfaces
    0 references
    Albertson-Berman conjecture
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references