Not-all-equal and 1-in-degree decompositions: algorithmic complexity and applications (Q1799219): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Zero-sum flows in regular graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On zero-sum 6-flows of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polychromatic colorings of plane graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Every 8-uniform 8-regular hypergraph is 2-colorable / rank
 
Normal rank
Property / cites work
 
Property / cites work: The satisfactory partition problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3097395 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nowhere-zero integral flows on a bidirected graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial-time algorithms for weighted efficient domination problems in AT-free graphs and dually chordal graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient Dominating and Edge Dominating Sets for Graphs and Hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5463534 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Parameterized Complexity of Domination-Type Problems and Application to Linear Codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: On zero-sum \({\mathbb{Z}_k}\)-magic labelings of 3-regular graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Relating edge-coverings to the classification of \(\mathbb Z^k_2\)-magic graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A sufficient condition for a matrix to be totally unimodular / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5678898 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On strongly planar not-all-equal 3SAT / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of the zero-sum 3-flows / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the algorithmic complexity of zero-sum edge-coloring / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmic complexity of proper labeling problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximum gap labelings of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating theDomatic Number / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmic approach to the satisfactory graph partitioning problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for vertex-partitioning problems on graphs with fixed clique-width. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized complexity of generalized domination problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the kernels of the incidence matrices of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4209364 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nowhere-Zero Flows on Signed Complete and Complete Bipartite Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: More about singular line graphs of trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hard tiling problems with simple tiles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3821582 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum-weight triangulation is NP-hard / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the null-spaces of acyclic and unicyclic singular graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4040221 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On simply structured bases of tree kernels / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the eigenvalues of distance powers of circuits / rank
 
Normal rank
Property / cites work
 
Property / cites work: On certain eigenspaces of cographs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sudoku graphs are integral / rank
 
Normal rank
Property / cites work
 
Property / cites work: On simply structured kernel bases of unicyclic graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tree decomposition by eigenvectors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Zero-sum flows of the linear lattice. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4498324 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Partitioning a graph into alliance free sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Group flow, complex flow, unit vector flow, and the \((2 + \epsilon)\)-flow conjecture / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Even Cycle Problem for Directed Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Contribution to the Theory of Chromatic Polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rees algebras of edge ideals / rank
 
Normal rank
Property / cites work
 
Property / cites work: Zero-Sum Flow Numbers of Triangular Grids / rank
 
Normal rank
Property / cites work
 
Property / cites work: Zero-Sum Flow Numbers of Hexagonal Grids / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constant Sum Flows in Regular Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Zero-Sum Flow Numbers of Regular Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nowhere-zero 4-flow in almost Petersen-minor free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nowhere-zero 15-flow in 3-edge-connected bidirected graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4869540 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nowhere-zero 3-flows and \(Z_{3}\)-connectivity of a family of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4206780 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nowhere-zero 4-flows and cycle double covers / rank
 
Normal rank

Revision as of 23:07, 16 July 2024

scientific article
Language Label Description Also known as
English
Not-all-equal and 1-in-degree decompositions: algorithmic complexity and applications
scientific article

    Statements

    Not-all-equal and 1-in-degree decompositions: algorithmic complexity and applications (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    18 October 2018
    0 references
    not-all-equal decomposition
    0 references
    1-in-degree decomposition
    0 references
    total perfect dominating set
    0 references
    zero-sum flow
    0 references
    zero-sum vertex flow
    0 references
    0 references
    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
    0 references