Algorithmic complexity of weakly semiregular partitioning and the representation number (Q528476): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2963515165 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1701.05934 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The inapproximability for the (0,1)-additive number / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computation of lucky number of planar graphs is NP-hard / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmic complexity of proper labeling problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of deciding whether the regular number is at most two / rank
 
Normal rank
Property / cites work
 
Property / cites work: Representation numbers of complete multipartite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: An algorithmic proof of Tutte's f-factor theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the connectivity of semiregular cages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5396749 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Covering planar graphs with forests / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a directed variation of the 1-2-3 and 1-2 conjectures / rank
 
Normal rank
Property / cites work
 
Property / cites work: On decomposing regular graphs into locally irregular subgraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of determining the irregular chromatic index of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Weak and strong versions of the 1-2-3 conjecture for uniform hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decomposing graphs into a constant number of locally irregular subgraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2808535 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Decomposition of Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the algorithmic complexity of adjacent vertex closed distinguishing colorings number of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3455031 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph Decomposition is NP-Complete: A Complete Proof of Holyer's Conjecture / rank
 
Normal rank
Property / cites work
 
Property / cites work: Representations of graphs and orthogonal latin square graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Representations of graphs modulo <i>n</i> / rank
 
Normal rank
Property / cites work
 
Property / cites work: Representations of graphs modulo \(n\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: The regular number of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Covering planar graphs with forests, one having bounded maximum degree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3856819 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The NP-Completeness of Edge-Coloring / rank
 
Normal rank
Property / cites work
 
Property / cites work: The NP-Completeness of Some Edge-Partition Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the unitary Cayley graphs of matrix algebras / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Complexity of General Graph Factor Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Regular number of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Orthogonal latin square graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4430618 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3424365 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph factors and factorization: 1985--2003: a survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: On decomposing graphs of large minimum degree into locally irregular subgraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3575472 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sequence variations of the 1-2-3 Conjecture and irregularity strength / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4869540 / rank
 
Normal rank

Latest revision as of 18:59, 13 July 2024

scientific article
Language Label Description Also known as
English
Algorithmic complexity of weakly semiregular partitioning and the representation number
scientific article

    Statements

    Algorithmic complexity of weakly semiregular partitioning and the representation number (English)
    0 references
    0 references
    0 references
    0 references
    12 May 2017
    0 references
    weakly semiregular number
    0 references
    semiregular number
    0 references
    edge-partition problems
    0 references
    locally irregular graph
    0 references
    representation number
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

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