On the Complexity of Planar Covering of Small Graphs (Q3104767): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q4017175 / rank
 
Normal rank
Property / cites work
 
Property / cites work: List-Coloring Squares of Sparse Subcubic Graphs / 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: On the complexity of H-coloring / rank
 
Normal rank
Property / cites work
 
Property / cites work: On possible counterexamples to Negami's planar cover conjecture / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of the \(L(p,q)\)-labeling problem for bipartite planar graphs of small degree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5387696 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Intersection graphs of segments / rank
 
Normal rank
Property / cites work
 
Property / cites work: Covering regular graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4223772 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Regular codes in regular graphs are difficult / rank
 
Normal rank
Property / cites work
 
Property / cites work: The spherical genus and virtually planar graphs / rank
 
Normal rank

Latest revision as of 18:39, 4 July 2024

scientific article
Language Label Description Also known as
English
On the Complexity of Planar Covering of Small Graphs
scientific article

    Statements