Properties of Large 2-Crossing-Critical Graphs (Q5084710): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
Normalize DOI.
 
(One intermediate revision by one other user not shown)
Property / DOI
 
Property / DOI: 10.7155/jgaa.00585 / rank
Normal rank
 
Property / cites work
 
Property / cites work: Every planar map is four colorable. I: Discharging / rank
 
Normal rank
Property / cites work
 
Property / cites work: A kuratowski theorem for the projective plane / rank
 
Normal rank
Property / cites work
 
Property / cites work: Forbidden minors characterization of partial 3-trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nonserial dynamic programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3795218 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Treewidth: Structure and Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: On degree properties of crossing-critical families of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5088941 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Characterizing 2-crossing-critical graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3726125 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph Drawing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph edge coloring: a survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graphs with forbidden subgraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The monadic second-order logic of graphs. I: Recognizable sets of finite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Structure and generation of crossing-critical graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On forbidden subdivision characterizations of graph classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Forbidden minors and subdivisions for toroidal graphs with no K3,3's / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing crossing numbers in quadratic time / rank
 
Normal rank
Property / cites work
 
Property / cites work: S-functions for graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3043709 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Crossing-number critical graphs have bounded path-width / rank
 
Normal rank
Property / cites work
 
Property / cites work: The NP-Completeness of Edge-Coloring / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3549636 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Construction of crossing-critical graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Guide to Graph Colouring / rank
 
Normal rank
Property / cites work
 
Property / cites work: A characterization of perfect graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Linear Time Algorithm for Embedding Graphs in an Arbitrary Surface / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4820543 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A semi-strong perfect graph theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ein Sechsfarbenproblem auf der Kugel / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph minors. III. Planar tree-width / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph minors. VIII: A Kuratowski theorem for general surfaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph minors. XX: Wagner's conjecture / rank
 
Normal rank
Property / cites work
 
Property / cites work: Infinite families of crossing-critical graphs with given average degree / rank
 
Normal rank
Property / cites work
 
Property / cites work: A characterization of partial 3-trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: The graph crossing number and its variants: a survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Crossing Numbers of Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph searching and a min-max theorem for tree-width / rank
 
Normal rank
Property / cites work
 
Property / cites work: Infinite families of crossing-critical graphs with a given crossing number / rank
 
Normal rank
Property / cites work
 
Property / cites work: Characterization problems for graphs, partially ordered sets, lattices, and families of sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: \textsc{ToTo}: an open database for computation, storage and retrieval of tree decompositions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Über eine Eigenschaft der ebenen Komplexe / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3002782 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.7155/JGAA.00585 / rank
 
Normal rank

Latest revision as of 15:52, 30 December 2024

scientific article; zbMATH DE number 7549464
Language Label Description Also known as
English
Properties of Large 2-Crossing-Critical Graphs
scientific article; zbMATH DE number 7549464

    Statements

    Properties of Large 2-Crossing-Critical Graphs (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    28 June 2022
    0 references
    crossing number
    0 references
    crossing-critical graph
    0 references
    chromatic number
    0 references
    chromatic index
    0 references
    treewidth
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers