Outerstring Graphs are $\chi$-Bounded (Q5244121): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the maximum number of edges in topological graphs with no four pairwise crossing edges / 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 a Coloring Problem. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5116474 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Research Problems in Discrete Geometry / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of diagram testing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Refining the hierarchies of classes of geometric intersection graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Intersection Graphs of Rays and Grounded Segments / rank
 
Normal rank
Property / cites work
 
Property / cites work: Coloring circle graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Coloring and Maximum Independent Set of Rectangles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Circle graphs are quadratically χ‐bounded / rank
 
Normal rank
Property / cites work
 
Property / cites work: A decomposition theorem for partially ordered sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Intersection graphs of curves in the plane / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Separator Theorem for String Graphs and its Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Coloring \(K_{k}\)-free intersection graphs of geometric objects in the plane / rank
 
Normal rank
Property / cites work
 
Property / cites work: String graphs and incomparability graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Applications of a New Separator Theorem for String Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Number of Edges in $k$-Quasi-planar Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of comparability graph recognition and coloring / rank
 
Normal rank
Property / cites work
 
Property / cites work: Comparability graphs and intersection graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the chromatic number of multiple interval graphs and overlap graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On String Graph Limits and the Structure of a Typical String Graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: On grounded \(\llcorner\)-graphs and their relatives / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the chromatic number of intersection graphs of convex sets in the plane / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Number of Finite Topologies / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3832590 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4657585 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Covering and coloring polygon-circle graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: String graphs. I: The number of critical nonstring graphs is infinite / rank
 
Normal rank
Property / cites work
 
Property / cites work: String graphs. II: Recognizing string graphs is NP-hard / rank
 
Normal rank
Property / cites work
 
Property / cites work: String graphs requiring exponential representations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Coloring triangle-free rectangle overlap graphs with \(O(\log \log n)\) colors / rank
 
Normal rank
Property / cites work
 
Property / cites work: On-line approach to off-line coloring problems on graphs with geometric representations / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Ramsey-Type Result for Convex Sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Coloring intersection graphs of arc-connected sets in the plane / rank
 
Normal rank
Property / cites work
 
Property / cites work: Separators in region intersection graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3320435 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4540061 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Near-Optimal Separators in String Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On bounding the chromatic number of L-graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Colouring arcwise connected sets in the plane. I / rank
 
Normal rank
Property / cites work
 
Property / cites work: Weakly transitive orientations, Hasse diagrams and string graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4852554 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5477819 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Applications of the crossing number / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5088986 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recognizing string graphs is decidable / rank
 
Normal rank
Property / cites work
 
Property / cites work: How many ways can one draw a graph? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Triangle-free geometric intersection graphs with large chromatic number / rank
 
Normal rank
Property / cites work
 
Property / cites work: Triangle-free intersection graphs of line segments with large chromatic number / rank
 
Normal rank
Property / cites work
 
Property / cites work: Coloring curves that cross a fixed curve / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recognizing string graphs in NP / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decidability of string graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Topology of Thin Film RC Circuits / rank
 
Normal rank
Property / cites work
 
Property / cites work: Coloring intersection graphs of \(x\)-monotone curves in the plane / 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
links / mardi / namelinks / mardi / name
 

Latest revision as of 00:10, 21 July 2024

scientific article; zbMATH DE number 7133117
Language Label Description Also known as
English
Outerstring Graphs are $\chi$-Bounded
scientific article; zbMATH DE number 7133117

    Statements

    Outerstring Graphs are $\chi$-Bounded (English)
    0 references
    0 references
    0 references
    20 November 2019
    0 references
    geometric intersection graphs
    0 references
    string graphs
    0 references
    chromatic number
    0 references
    \( \chi \)-boundedness
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers