Boundary properties of graphs for algorithmic graph problems (Q551178): 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.1016/j.tcs.2011.03.001 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2085479935 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3362547 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4369478 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On easy and hard hereditary classes of graphs with respect to the independent set problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Boundary classes of graphs for the dominating set problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: NP-hard graph problems and boundary classes of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two New Classes of Hamiltonian Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The speed of hereditary properties of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distance-hereditary graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5782525 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The strong perfect graph theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An interval graph is not a comparability graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: ON THE CLIQUE-WIDTH OF SOME PERFECT GRAPH CLASSES / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hamilton Paths in Grid Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: An interval graph is a comparability graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hamiltonian Cycles in Subcubic Graphs: What Makes the Problem Difficult / rank
 
Normal rank
Property / cites work
 
Property / cites work: Boundary Classes of Planar Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Chordal bipartite graphs of bounded tree- and clique-width / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new series of dense graphs of high girth / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the number of boundary classes in the 3-colouring problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3115195 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3115202 / rank
 
Normal rank
Property / cites work
 
Property / cites work: HAMILTONian circuits in chordal bipartite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing independent sets in graphs with large girth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proper minor-closed families are small / rank
 
Normal rank
Property / cites work
 
Property / cites work: The NP-completeness of the Hamiltonian cycle problem in planar digraphs with degree bound two / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph minors. V. Excluding a planar graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the size of hereditary classes of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nonredundant 1’s in $\Gamma $-Free Matrices / rank
 
Normal rank

Revision as of 06:30, 4 July 2024

scientific article
Language Label Description Also known as
English
Boundary properties of graphs for algorithmic graph problems
scientific article

    Statements

    Boundary properties of graphs for algorithmic graph problems (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    14 July 2011
    0 references
    computational complexity
    0 references
    hereditary class
    0 references
    Hamiltonian cycle
    0 references
    vertex colorability
    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