On extension of regular graphs (Q5031864): 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: W2964172119 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1509.05476 / 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: Q3097395 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2743189 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hamiltonian cycles in random regular graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Counting colorings of a regular graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5403625 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On maximum matchings in almost regular graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matchings in regular graphs from eigenvalues / rank
 
Normal rank
Property / cites work
 
Property / cites work: Balloons, cut-edges, matchings, and total domination in regular graphs of odd degree / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 00:50, 28 July 2024

scientific article; zbMATH DE number 7474869
Language Label Description Also known as
English
On extension of regular graphs
scientific article; zbMATH DE number 7474869

    Statements

    On extension of regular graphs (English)
    0 references
    0 references
    0 references
    16 February 2022
    0 references
    regular graph
    0 references
    matching on regular graph
    0 references
    bipartite regular graph
    0 references
    extension of regularity
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references