A note on selective line-graphs and partition colorings (Q2294381): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Import241208061232 (talk | contribs)
Normalize DOI.
 
(6 intermediate revisions by 5 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.orl.2019.08.005 / rank
Normal rank
 
Property / describes a project that uses
 
Property / describes a project that uses: GitHub / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: sgcp-via-cliques / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2972847949 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Perfectness of clustered graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on the Cornaz-Jost transformation to solve the graph coloring problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving vertex coloring problems as maximum weight stable set problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A one-to-one correspondence between colorings and stable sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Chromatic Gallai identities operating on Lovász number / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the minimum and maximum selective graph coloring problems in some graph classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: On some applications of the selective graph coloring problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of the selective graph coloring problem in some special classes of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Weighted sum coloring in batch scheduling of conflicting jobs / rank
 
Normal rank
Property / cites work
 
Property / cites work: An exact algorithm for the partition coloring problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximum-weight stable sets and safe lower bounds for graph coloring / rank
 
Normal rank
Property / cites work
 
Property / cites work: A branch-and-price approach for the partition coloring problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Routing and wavelength assignment by partition colouring / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the recursive largest first algorithm for graph colouring / rank
 
Normal rank
Property / cites work
 
Property / cites work: Facet-inducing web and antiweb inequalities for the graph coloring polytope / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial optimization. Polyhedra and efficiency (3 volumes) / rank
 
Normal rank
Property / cites work
 
Property / cites work: An exact cutting plane algorithm to solve the selective graph coloring problem in perfect graphs / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.ORL.2019.08.005 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 20:59, 17 December 2024

scientific article
Language Label Description Also known as
English
A note on selective line-graphs and partition colorings
scientific article

    Statements

    A note on selective line-graphs and partition colorings (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    10 February 2020
    0 references
    selective/partition coloring
    0 references
    line graph
    0 references
    stable set
    0 references
    max-coloring
    0 references

    Identifiers