Upper bounds for bar visibility of subgraphs and \(n\)-vertex graphs (Q2192084): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 4 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3001736147 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1904.08707 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Gallai's path decomposition conjecture for graphs of small maximum degree / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Bar Visibility Number of a Graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the planar split thickness of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solution of Heawood's empire problem in the plane. / 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: A short solution of Heawood's empire problem in the plane / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 23:44, 22 July 2024

scientific article
Language Label Description Also known as
English
Upper bounds for bar visibility of subgraphs and \(n\)-vertex graphs
scientific article

    Statements

    Upper bounds for bar visibility of subgraphs and \(n\)-vertex graphs (English)
    0 references
    0 references
    0 references
    0 references
    29 June 2020
    0 references
    bar visibility number
    0 references
    bar visibility graph
    0 references
    planar graph
    0 references

    Identifiers