Colouring clique-hypergraphs of circulant graphs (Q5900086): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.endm.2008.01.033 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2596432422 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Coloring the Maximal Cliques of Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: LexBFS-orderings and powers of chordal graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A result on the total colouring of powers of cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hardness results and spectral techniques for combinatorial problems on circulant graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two-colouring all two-element maximal antichains / rank
 
Normal rank
Property / cites work
 
Property / cites work: Coloring the hypergraph of maximal cliques of a graph with no long path / rank
 
Normal rank
Property / cites work
 
Property / cites work: On planarity and colorability of circulant graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of bicoloring clique hypergraphs of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sur le coloriage des graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum chromaticity of circulant graphs / rank
 
Normal rank

Latest revision as of 10:22, 28 June 2024

scientific article; zbMATH DE number 5284997
Language Label Description Also known as
English
Colouring clique-hypergraphs of circulant graphs
scientific article; zbMATH DE number 5284997

    Statements

    Identifiers