Finding regular subgraphs in both arbitrary and planar graphs (Q1923612): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3941433 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new 5‐arc‐transitive cubic graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3728911 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Problems complete for deterministic logarithmic space / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deciding whether a planar graph has a cubic subgraph is NP-complete / rank
 
Normal rank
Property / cites work
 
Property / cites work: On locating cubic subgraphs in bounded-degree connected bipartite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4385515 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 14:06, 24 May 2024

scientific article
Language Label Description Also known as
English
Finding regular subgraphs in both arbitrary and planar graphs
scientific article

    Statements

    Finding regular subgraphs in both arbitrary and planar graphs (English)
    0 references
    0 references
    14 January 1997
    0 references
    planar graph
    0 references

    Identifiers