Universal graphs with a forbidden subgraph: block path solidity (Q1677537): Difference between revisions
From MaRDI portal
Changed an Item |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Universal graphs with a forbidden subtree / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Universal graphs with a forbidden near‐path or 2‐bouquet / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Club guessing and the universal models / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On the existence of countable universal graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A family of countable homogeneous graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Universal elements and the complexity of certain classes of infinite graphs / rank | |||
Normal rank |
Revision as of 16:47, 14 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Universal graphs with a forbidden subgraph: block path solidity |
scientific article |
Statements
Universal graphs with a forbidden subgraph: block path solidity (English)
0 references
10 November 2017
0 references
connected graph
0 references
forbidden subgraph
0 references
block path
0 references