Edge Partitions and Visibility Representations of 1-planar Graphs (Q5001658): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/978-981-15-6533-5_6 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3090990029 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on 1-planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On 3D visibility representations of graphs with few crossings per edge / rank
 
Normal rank
Property / cites work
 
Property / cites work: Visibility representations of boxes in 2.5 dimensions / rank
 
Normal rank
Property / cites work
 
Property / cites work: \(\mathsf{NIC}\)-planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized Complexity of 1-Planarity / rank
 
Normal rank
Property / cites work
 
Property / cites work: The book thickness of 1-planar graphs is constant / rank
 
Normal rank
Property / cites work
 
Property / cites work: Edge partitions of optimal 2-plane and 3-plane graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Planar Graphs of Bounded Degree Have Bounded Queue Number / rank
 
Normal rank
Property / cites work
 
Property / cites work: Embedding-preserving rectangle visibility representations of nonplanar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: An experimental study of a 1-planarity testing and embedding algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bemerkungen zu einem Sechsfarbenproblem von G. Ringel / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3679212 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Visibility Representation for Graphs in Three Dimensions / rank
 
Normal rank
Property / cites work
 
Property / cites work: 1-Visibility Representations of 1-Planar Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recognizing optimal 1-planar graphs in linear time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recognizing and drawing IC-planar graphs / 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: Graphs with forbidden subgraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A linear-time algorithm for 7-coloring 1-plane graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On drawings and decompositions of 1-planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Drawing graph joins in the plane with restrictions on crossings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bar k-Visibility Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: New results on edge partitions of 1-plane graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ortho-polygon visibility representations of embedded graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Density of straight-line 1-planar graph drawings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Surfaces, tree-width, clique-minors, and partitions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Representing a planar graph by vertical lines joining different levels / rank
 
Normal rank
Property / cites work
 
Property / cites work: Structure of Graphs with Locally Restricted Crossings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Planar Graphs Have Bounded Queue-Number / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3832583 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bar 1-Visibility Graphs and their relation to other Nearly Planar Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simultaneous visibility representations of plane \(st\)-graphs using L-shapes / rank
 
Normal rank
Property / cites work
 
Property / cites work: RECTANGLE AND BOX VISIBILITY GRAPHS IN 3D / rank
 
Normal rank
Property / cites work
 
Property / cites work: Edge partition of planar sraphs into two outerplanar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for graphs embeddable with few crossings per edge / rank
 
Normal rank
Property / cites work
 
Property / cites work: Further Results on Bar k-Visibility Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On representations of some thickness-two graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: An upper bound on the number of edges in an almost planar bipartite graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Outerplanar partitions of planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: An annotated bibliography on 1-planarity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimal Obstructions for 1-Immersions and Hardness of 1-Planarity Testing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Coloring plane graphs with independent crossings / rank
 
Normal rank
Property / cites work
 
Property / cites work: On partitioning the edges of 1-plane graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: L-visibility drawings of IC-planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ortho-polygon visibility representations of 3-connected 1-plane graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Edge-Disjoint Spanning Trees of Finite Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Characterisations and examples of graph classes with bounded expansion / 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: Rectilinear planar layouts and bipolar orientations of planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3138887 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Unimaximal Sequences of Pairs in Rectangle Visibility Drawing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal 1-planar graphs which triangulate other surfaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: A unified approach to visibility representations of planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3216670 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The structure of plane graphs with independent crossings and its applications to coloring problems / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 07:04, 26 July 2024

scientific article; zbMATH DE number 7374187
Language Label Description Also known as
English
Edge Partitions and Visibility Representations of 1-planar Graphs
scientific article; zbMATH DE number 7374187

    Statements

    Edge Partitions and Visibility Representations of 1-planar Graphs (English)
    0 references
    0 references
    0 references
    22 July 2021
    0 references
    visibility representations of 1-planar graphs
    0 references
    graph drawing
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers