Hadwiger Number of Graphs with Small Chordality (Q2945190): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by one other user not shown)
description / endescription / en
scientific article
scientific article; zbMATH DE number 6472955
Property / zbMATH Open document ID
 
Property / zbMATH Open document ID: 1327.05322 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1137/140975279 / rank
 
Normal rank
Property / published in
 
Property / published in: SIAM Journal on Discrete Mathematics / rank
 
Normal rank
Property / publication date
 
17 August 2015
Timestamp+2015-08-17T00:00:00Z
Timezone+00:00
CalendarGregorian
Precision1 day
Before0
After0
Property / publication date: 17 August 2015 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 68R10 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 68W40 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6472955 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2799759016 / rank
 
Normal rank
Property / zbMATH Keywords
 
Hadwiger number
Property / zbMATH Keywords: Hadwiger number / rank
 
Normal rank
Property / zbMATH Keywords
 
cographs
Property / zbMATH Keywords: cographs / rank
 
Normal rank
Property / zbMATH Keywords
 
bipartite permutation graphs
Property / zbMATH Keywords: bipartite permutation graphs / rank
 
Normal rank
Property / zbMATH Keywords
 
AT-free graphs
Property / zbMATH Keywords: AT-free graphs / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: Algorithm 97 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating the maximum clique minor and some subgraph homeomorphism problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hadwiger's conjecture is true for almost every graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph Classes: A Survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Contracting Few Edges to Remove Forbidden Induced Subgraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Asteroidal Triple-Free Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear Time Algorithms for Dominating Pairs in Asteroidal Triple-free Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Linear Recognition Algorithm for Cographs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fundamentals of parameterized complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding Large Clique Minors is Hard / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmic graph theory and perfect graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A simple linear time algorithm for cograph recognition / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5837979 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Contracting graphs to paths and trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Connected matchings in chordal bipartite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Hardness of Eliminating Small Induced Subgraphs by Contracting Edges / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph minors. XIII: The disjoint paths problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of satisfiability problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bipartite permutation graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear degree extractors and the inapproximability of max clique and chromatic number / rank
 
Normal rank

Latest revision as of 15:17, 10 July 2024

scientific article; zbMATH DE number 6472955
Language Label Description Also known as
English
Hadwiger Number of Graphs with Small Chordality
scientific article; zbMATH DE number 6472955

    Statements

    Hadwiger Number of Graphs with Small Chordality (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    9 September 2015
    0 references
    17 August 2015
    0 references
    Hadwiger number
    0 references
    cographs
    0 references
    bipartite permutation graphs
    0 references
    AT-free graphs
    0 references

    Identifiers

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