Some colouring problems for Paley graphs (Q817760): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Normalize DOI.
 
(7 intermediate revisions by 6 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.disc.2005.10.018 / rank
Normal rank
 
Property / author
 
Property / author: David B. Penman / rank
Normal rank
 
Property / author
 
Property / author: David B. Penman / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.disc.2005.10.018 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1967020912 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The star arboricity of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3142409 / rank
 
Normal rank
Property / cites work
 
Property / cites work: List coloring of random and pseudo-random graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the adjacency properties of paley graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximal cliques in the Paley graph of square order / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graphical properties related to minimal imperfection / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5184989 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Paths in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: THE CLIQUE NUMBERS AND CHROMATIC NUMBERS OF CERTAIN PALEY GRAPHS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3320418 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5707657 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4352945 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The list chromatic index of a bipartite multigraph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3997075 / rank
 
Normal rank
Property / cites work
 
Property / cites work: New Bounds on the List-Chromatic Index of the Complete Graph and Other Simple Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: An upper bound for the total chromatic number of dense graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graphs of degree 4 are 5-edge-choosable / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4326643 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4002255 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3880849 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On total colourings of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4549228 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4500483 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4376970 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Total colourings of graphs / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.DISC.2005.10.018 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 03:58, 10 December 2024

scientific article
Language Label Description Also known as
English
Some colouring problems for Paley graphs
scientific article

    Statements

    Some colouring problems for Paley graphs (English)
    0 references
    0 references
    0 references
    20 March 2006
    0 references
    pseudo-random graph
    0 references
    graph colourings
    0 references

    Identifiers