On bipartization of cubic graphs by removal of an independent set (Q298966): Difference between revisions
From MaRDI portal
Created a new Item |
Normalize DOI. |
||
(9 intermediate revisions by 7 users not shown) | |||
Property / DOI | |||
Property / DOI: 10.1016/j.dam.2015.10.036 / rank | |||
Property / author | |||
Property / author: Stanislaw P. Radziszowski / rank | |||
Property / author | |||
Property / author: Stanislaw P. Radziszowski / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 05C69 / rank | |||
Normal rank | |||
Property / zbMATH DE Number | |||
Property / zbMATH DE Number: 6595953 / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
bipartization | |||
Property / zbMATH Keywords: bipartization / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
cubic graphs | |||
Property / zbMATH Keywords: cubic graphs / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
decycling number | |||
Property / zbMATH Keywords: decycling number / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
equitable coloring | |||
Property / zbMATH Keywords: equitable coloring / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
feedback-vertex set | |||
Property / zbMATH Keywords: feedback-vertex set / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
independent set | |||
Property / zbMATH Keywords: independent set / 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 | |||
links / mardi / name | links / mardi / name | ||
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
On bipartization of cubic graphs by removal of an independent set (English)
0 references
21 June 2016
0 references
bipartization
0 references
cubic graphs
0 references
decycling number
0 references
equitable coloring
0 references
feedback-vertex set
0 references
independent set
0 references
0 references
0 references