Hamiltonicity and colorings of arrangement graphs (Q860408): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.dam.2006.04.006 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2003299221 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hamiltonian decomposition of Cayley graphs of degree 4 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4003411 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198785 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4871748 / rank
 
Normal rank
Property / cites work
 
Property / cites work: PROPERTIES OF ARRANGEMENT GRAPHS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Arrangement graphs: A class of generalized star graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constructing Arrangements of Lines and Hyperplanes with Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4871765 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sweeps, arrangements and signotopes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proof of a conjecture of Burr, Grünbaum, and Sloane / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4400995 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3138746 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5663020 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4529492 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding Hamiltonian circuits in arrangements of Jordan curves is NP- complete / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3950573 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4857375 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounding the number of embeddings of 5-connected projective-planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: From the theory of regular graphs of third and fourth degree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Embedding longest fault-free paths in arrangement graphs with faulty vertices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Planar graphs: Theory and algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4254919 / rank
 
Normal rank
Property / cites work
 
Property / cites work: 4-connected projective planar graphs are Hamiltonian / rank
 
Normal rank
Property / cites work
 
Property / cites work: A theorem on paths in planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Theorem on Planar Graphs / rank
 
Normal rank

Latest revision as of 11:05, 25 June 2024

scientific article
Language Label Description Also known as
English
Hamiltonicity and colorings of arrangement graphs
scientific article

    Statements

    Hamiltonicity and colorings of arrangement graphs (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    9 January 2007
    0 references
    line and pseudoline arrangement
    0 references
    circle and pseudocircle arrangement
    0 references
    Hamilton path
    0 references
    Hamilton cycle
    0 references
    Hamilton decomposition
    0 references
    coloring
    0 references
    connectivity
    0 references
    planar graph
    0 references
    projective-planar graph
    0 references

    Identifiers