The chromatic numbers of double coverings of a graph (Q2519824): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / arXiv ID
 
Property / arXiv ID: math/0507110 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Random lifts of graphs: Independence and chromatic number / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bipartite covering graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Signatures and signed switching classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Map-Colour Theorems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Characteristic polynomials of graph coverings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generating all graph coverings by permutation voltage assignments / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3757929 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3126442 / rank
 
Normal rank
Property / cites work
 
Property / cites work: ENUMERATION OF HOMOMORPHISMS AND SURFACE-COVERINGS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2715969 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Isomorphism Classes of Graph Bundles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Caracteristics polynomials of some grap bundlesII / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4543031 / rank
 
Normal rank

Latest revision as of 00:58, 29 June 2024

scientific article
Language Label Description Also known as
English
The chromatic numbers of double coverings of a graph
scientific article

    Statements