On minimal arbitrarily partitionable graphs (Q456092): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Import241208061232 (talk | contribs)
Normalize DOI.
 
(6 intermediate revisions by 6 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.ipl.2012.06.010 / rank
Normal rank
 
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 05C70 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 68R10 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6098069 / rank
 
Normal rank
Property / zbMATH Keywords
 
minimal arbitrarily partitionable graph
Property / zbMATH Keywords: minimal arbitrarily partitionable graph / rank
 
Normal rank
Property / zbMATH Keywords
 
arbitrary vertex decomposable graph
Property / zbMATH Keywords: arbitrary vertex decomposable graph / rank
 
Normal rank
Property / zbMATH Keywords
 
interconnection networks
Property / zbMATH Keywords: interconnection networks / 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.1016/j.ipl.2012.06.010 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2057626995 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decomposable trees: A polynomial algorithm for tripodes / rank
 
Normal rank
Property / cites work
 
Property / cites work: A degree bound on decomposable trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the shape of decomposable trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the structure of arbitrarily partitionable graphs with given connectivity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Arbitrarily vertex decomposable caterpillars with four or five leaves / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4168622 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On arbitrarily vertex decomposable trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: A homology theory for spanning tress of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: A linear-time algorithm for four-partitioning four-connected planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decomposing trees with large diameter / rank
 
Normal rank
Property / cites work
 
Property / cites work: A linear algorithm for bipartition of biconnected graphs / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.IPL.2012.06.010 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 18:06, 9 December 2024

scientific article
Language Label Description Also known as
English
On minimal arbitrarily partitionable graphs
scientific article

    Statements

    Identifiers