Characterizing and bounding the imperfection ratio for some classes of graphs (Q1016110): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
Normalize DOI.
 
(3 intermediate revisions by 3 users not shown)
Property / DOI
 
Property / DOI: 10.1007/s10107-007-0182-9 / rank
Normal rank
 
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s10107-007-0182-9 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2011676058 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4329155 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Coloring quasi-line graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The strong perfect graph theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3416248 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On certain polytopes associated with graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximum matching and a polyhedron with 0,1-vertices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Circular Ones Matrices and the Stable Set Polytope of Quasi-Line Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph imperfection. I / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph imperfection. II / rank
 
Normal rank
Property / cites work
 
Property / cites work: Geometric algorithms and combinatorial optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sur le coloriage des graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Applying Lehman's theorems to packing problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Antiwebs are rank-perfect / rank
 
Normal rank
Property / cites work
 
Property / cites work: On rank-perfect subclasses of near-bipartite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Circular chromatic number: A survey / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/S10107-007-0182-9 / rank
 
Normal rank

Latest revision as of 13:04, 10 December 2024

scientific article
Language Label Description Also known as
English
Characterizing and bounding the imperfection ratio for some classes of graphs
scientific article

    Statements

    Identifiers