On bipartization of cubic graphs by removal of an independent set (Q298966): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claim: author (P16): Item:Q1010890
Normalize DOI.
 
(6 intermediate revisions by 6 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.dam.2015.10.036 / rank
Normal rank
 
Property / author
 
Property / author: Stanislaw P. Radziszowski / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2177022054 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1406.2728 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast algorithms for max independent set / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5782525 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Equitable coloring and the maximum degree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph Bipartization and via minimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximum independent sets in 3- and 4-regular Hamiltonian graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the independence number of random cubic graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Equitable and semi-equitable coloring of cubic graphs and its application in batch scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Independent sets in triangle-free cubic planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithm Engineering for Optimal Graph Bipartization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Faster computation of maximum independent set and parameterized vertex cover for graphs with maximum degree 3 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the nonseparating independent set problem and feedback set problem for graphs with no vertex degree exceeding three / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.DAM.2015.10.036 / rank
 
Normal rank

Latest revision as of 13:44, 9 December 2024

scientific article
Language Label Description Also known as
English
On bipartization of cubic graphs by removal of an independent set
scientific article

    Statements

    Identifiers