Triangle-Free Penny Graphs: Degeneracy, Choosability, and Edge Count (Q4625139): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Representing graphs by disks and balls (a survey of recognition-complexity results) / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Triangle Contact Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rectangular layouts and contact graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial Properties of Triangle-Free Rectangle Arrangements and the Squarability Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Contact graphs of line segments are NP-complete / rank
 
Normal rank
Property / cites work
 
Property / cites work: Contact Graphs of Circular Arcs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the independence number of minimum distance graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5881910 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Realization of Simply Connected Polygonal Linkages and Recognition of Unit Disk Contact Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4820391 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4228512 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4328195 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the maximum number of edges in quasi-planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quasi-planar graphs have a linear number of edges / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Density of Maximal 1-Planar Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Densities of minor-closed graph families / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graphs drawn with few crossings per edge / rank
 
Normal rank
Property / cites work
 
Property / cites work: New bounds on the maximum number of edges in \(k\)-quasi-planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A short list color proof of Grötzsch's theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4633932 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A not 3-choosable planar graph without 3-cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Colorings and orientations of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: 3-Choosability of Triangle-Free Planar Graphs with Constraints on 4-Cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorics and Geometry of Finite and Infinite Squaregraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Triangle-Free Penny Graphs: Degeneracy, Choosability, and Edge Count / rank
 
Normal rank

Latest revision as of 08:03, 18 July 2024

scientific article; zbMATH DE number 7027011
Language Label Description Also known as
English
Triangle-Free Penny Graphs: Degeneracy, Choosability, and Edge Count
scientific article; zbMATH DE number 7027011

    Statements

    Triangle-Free Penny Graphs: Degeneracy, Choosability, and Edge Count (English)
    0 references
    0 references
    20 February 2019
    0 references
    list coloring number
    0 references
    diameter
    0 references

    Identifiers