The treewidth of line graphs (Q723884): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Created claim: Wikidata QID (P12): Q129913720, #quickstatements; #temporary_batch_1726359655382
 
(4 intermediate revisions by 4 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2962819865 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1409.6810 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On digraph coloring problems and treewidth duality / rank
 
Normal rank
Property / cites work
 
Property / cites work: A framework for solving VLSI graph layout problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On embedding graphs in trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4291429 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The hardness of perfect phylogeny, feasible register assignment and other problems on thin colored graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Derivation of algorithms for cutwidth and related graph layout parameters / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multicuts in unweighted graphs and digraphs with bounded degree and bounded tree-width / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Cutwidth and the Topological Bandwidth of a Tree / rank
 
Normal rank
Property / cites work
 
Property / cites work: A minimum degree condition forcing complete graph immersion / rank
 
Normal rank
Property / cites work
 
Property / cites work: The cutwidth of a graph and the vertex separation number of the line graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: On tree width, bramble size, and expansion / rank
 
Normal rank
Property / cites work
 
Property / cites work: Treewidth of the Line Graph of a Complete Graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameters Tied to Treewidth / rank
 
Normal rank
Property / cites work
 
Property / cites work: The vertex separation number of a graph equals its path-width / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tree-width, path-width, and cutwidth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Black-white pebbles and graph separation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Achievable sets, brambles, and sparse treewidth obstructions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Topological Bandwidth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3002818 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4540091 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph minors. II. Algorithmic aspects of tree-width / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cutwidth I: A linear time fixed parameter algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cutwidth II: Algorithms for partial w-trees of bounded degree / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q129913720 / rank
 
Normal rank

Latest revision as of 02:21, 15 September 2024

scientific article
Language Label Description Also known as
English
The treewidth of line graphs
scientific article

    Statements

    The treewidth of line graphs (English)
    0 references
    0 references
    0 references
    24 July 2018
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    treewidth
    0 references
    pathwidth
    0 references
    line graphs
    0 references
    vertex congestion
    0 references
    0 references
    0 references
    0 references