On Strict (Outer-)Confluent Graphs (Q5084690): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: A game of cops and robbers / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Bundled Crossing Number / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms for NP-complete problems on planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hereditary modular graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distance-hereditary graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: More characterizations of triangulated graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the cop number of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Circle graph obstructions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bundled crossings revisited / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear time solvable optimization problems on graphs of bounded clique-width / rank
 
Normal rank
Property / cites work
 
Property / cites work: Upper bounds to the clique width of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4405810 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Trapezoid graphs and their coloring / rank
 
Normal rank
Property / cites work
 
Property / cites work: Confluent Drawings: Visualizing Non-planar Diagrams in a Planar Way / rank
 
Normal rank
Property / cites work
 
Property / cites work: Topology of series-parallel networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Confluent layered drawings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph Drawing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strict Confluent Drawing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Confluent Hasse Diagrams / rank
 
Normal rank
Property / cites work
 
Property / cites work: Trapezoid graphs and generalizations, geometry and algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bundled Crossings in Embedded Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recognizing circle graphs in polynomial time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Transitiv orientierbare Graphen / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cops and robbers on intersection graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for Minimum Coloring, Maximum Clique, Minimum Covering by Cliques, and Maximum Independent Set of a Chordal Graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximum weight independent sets and cliques in intersection graphs of filaments / rank
 
Normal rank
Property / cites work
 
Property / cites work: Split decomposition and graph-labelled trees: characterizations and fully dynamic algorithms for totally decomposable graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmic graph theory and perfect graphs / 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 CLIQUE-WIDTH OF SOME PERFECT GRAPH CLASSES / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3263885 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3271426 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Alternation Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximum Weight Clique Algorithms for Circular-Arc Graphs and Circle Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Train tracks and confluent drawings / 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: Vertex-to-vertex pursuit in a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Transitive Orientation of Graphs and Identification of Permutation Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5588432 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear-time computability of combinatorial problems on series-parallel graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4004146 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Block Crossings in Storyline Visualizations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing Storyline Visualizations with Few Block Crossings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient parallel algorithms for doubly convex-bipartite graphs / rank
 
Normal rank

Revision as of 11:17, 29 July 2024

scientific article; zbMATH DE number 7549447
Language Label Description Also known as
English
On Strict (Outer-)Confluent Graphs
scientific article; zbMATH DE number 7549447

    Statements

    On Strict (Outer-)Confluent Graphs (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    28 June 2022
    0 references
    0 references
    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
    0 references