On the hardness of finding the geodetic number of a subcubic graph (Q1708262): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Normalize DOI.
 
(3 intermediate revisions by 3 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.ipl.2018.02.012 / rank
Normal rank
 
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.ipl.2018.02.012 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2791124391 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some APX-completeness results for cubic graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hull number: \(P_5\)-free graphs and reduction rules / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational Complexity of Geodetic Set / rank
 
Normal rank
Property / cites work
 
Property / cites work: On The Edge Geodetic Number Of A Graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: The geodetic hull number is hard for chordal graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the geodetic number and related metric sets in Cartesian product graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the geodetic hull number of \(P_{k}\)-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some remarks on the geodetic number of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the geodetic and geodetic domination numbers of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: The hull and geodetic numbers of orientations of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The upper connected geodetic number and forcing connected geodetic number of a graph / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.IPL.2018.02.012 / rank
 
Normal rank

Latest revision as of 05:11, 11 December 2024

scientific article
Language Label Description Also known as
English
On the hardness of finding the geodetic number of a subcubic graph
scientific article

    Statements

    On the hardness of finding the geodetic number of a subcubic graph (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    5 April 2018
    0 references
    geodetic number
    0 references
    geodetic set
    0 references
    geodetic convexity
    0 references
    computational complexity
    0 references
    maximum degree three
    0 references

    Identifiers