Hierarchical and modularly-minimal vertex colorings (Q5058209): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / OpenAlex ID
 
Property / OpenAlex ID: W4214657493 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 2004.06340 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recovering symbolically dated, rooted trees from symbolic ultrametrics / rank
 
Normal rank
Property / cites work
 
Property / cites work: On algorithms for (\(P_5\), gem)-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nonrecursive traversals of trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some perfect coloring properties of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complement reducible graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Transitiv orientierbare Graphen / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reciprocal best match graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3836509 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On extended \(P_4\)-reducible and extended \(P_4\)-sparse graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A survey of the algorithmic aspects of modular decomposition / rank
 
Normal rank
Property / cites work
 
Property / cites work: Orthology relations, symbolic ultrametrics, and cographs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A tree representation for \(P_ 4\)-sparse graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear time optimization algorithms for \(P_ 4\)-sparse graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4857375 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reducibility among Combinatorial Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Guide to Graph Colouring / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reservoir-sampling algorithms of time complexity <i>O</i> ( <i>n</i> (1 + log( <i>N</i> / <i>n</i> ))) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Acyclic and star colorings of cographs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing Graph Polynomials on Graphs of Bounded Clique-Width / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear-time modular decomposition of directed graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Modular decomposition and transitive orientation / rank
 
Normal rank
Property / cites work
 
Property / cites work: BOUNDED SEARCH TREE ALGORITHMS FOR PARAMETRIZED COGRAPH DELETION: EFFICIENT BRANCHING RULES BY EXPLOITING STRUCTURES OF SPECIAL GRAPH CLASSES / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recursively constructible families of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recursive Graphs, Recursive Labelings and Shortest Paths / rank
 
Normal rank
Property / cites work
 
Property / cites work: Vertex colouring and forbidden subgraphs -- a survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Results on the Grundy chromatic number of graphs / rank
 
Normal rank

Latest revision as of 04:28, 31 July 2024

scientific article; zbMATH DE number 7634362
Language Label Description Also known as
English
Hierarchical and modularly-minimal vertex colorings
scientific article; zbMATH DE number 7634362

    Statements

    Hierarchical and modularly-minimal vertex colorings (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    19 December 2022
    0 references
    propert vertex coloring
    0 references
    Grundy number
    0 references
    cograph
    0 references
    modular decomposition
    0 references
    chromatics number
    0 references
    \(P_4\)-sparse graphs
    0 references
    0 references
    0 references

    Identifiers

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