- Location
-
Deutsche Nationalbibliothek Frankfurt am Main
- ISSN
-
1435-5914
- Extent
-
Online-Ressource
- Language
-
Englisch
- Notes
-
online resource.
- Bibliographic citation
-
Disjoint Paired-Dominating sets in Cubic Graphs ; volume:35 ; number:5 ; day:15 ; month:7 ; year:2019 ; pages:1129-1138 ; date:9.2019
Graphs and combinatorics ; 35, Heft 5 (15.7.2019), 1129-1138, 9.2019
- Creator
-
Bacsó, Gábor
Bujtás, Csilla
Tompkins, Casey
Tuza, Zsolt
- Contributor
-
SpringerLink (Online service)
- DOI
-
10.1007/s00373-019-02063-w
- URN
-
urn:nbn:de:101:1-2020012920430895710036
- Rights
-
Open Access; Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Last update
-
14.08.2025, 10:44 AM CEST
Data provider
This object is provided by:
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.
Associated
- Bacsó, Gábor
- Bujtás, Csilla
- Tompkins, Casey
- Tuza, Zsolt
- SpringerLink (Online service)
Other Objects (12)
Short disjoint cycles in cubic bridgeless graphs
Concurrent disjoint set union
Shortest edge disjoint paths in graphs
Finding Disjoint Paths on Directed Acyclic Graphs
Escaping Fatou components with disjoint hyperbolic limit sets
Symmetric Cubic Graphs as Cayley Graphs
Computing vertex-disjoint paths in large graphs using MAOs
Paired and induced-paired domination in (E,net)-free graphs
Edge-Disjoint Paths in Planar Graphs with Short Total Length
Edge-Connectivity and Pairwise Disjoint Perfect Matchings in Regular Graphs
Induced Disjoint Paths and Connected Subgraphs for H-Free Graphs
Reliability assessment of power distribution systems using disjoint path-set algorithm
Short disjoint cycles in cubic bridgeless graphs
Concurrent disjoint set union
Shortest edge disjoint paths in graphs
Finding Disjoint Paths on Directed Acyclic Graphs
Escaping Fatou components with disjoint hyperbolic limit sets
Symmetric Cubic Graphs as Cayley Graphs
Computing vertex-disjoint paths in large graphs using MAOs
Paired and induced-paired domination in (E,net)-free graphs
Edge-Disjoint Paths in Planar Graphs with Short Total Length
Edge-Connectivity and Pairwise Disjoint Perfect Matchings in Regular Graphs
Induced Disjoint Paths and Connected Subgraphs for H-Free Graphs
Reliability assessment of power distribution systems using disjoint path-set algorithm
Short disjoint cycles in cubic bridgeless graphs
Concurrent disjoint set union
Shortest edge disjoint paths in graphs
Finding Disjoint Paths on Directed Acyclic Graphs
Escaping Fatou components with disjoint hyperbolic limit sets
Symmetric Cubic Graphs as Cayley Graphs
Computing vertex-disjoint paths in large graphs using MAOs
Paired and induced-paired domination in (E,net)-free graphs
Edge-Disjoint Paths in Planar Graphs with Short Total Length
Edge-Connectivity and Pairwise Disjoint Perfect Matchings in Regular Graphs
Induced Disjoint Paths and Connected Subgraphs for H-Free Graphs