Finding a path with two labels forbidden in group-labeled graphs (Q2173429): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||||||||||||||
(4 intermediate revisions by 3 users not shown) | |||||||||||||||
aliases / en / 0 | aliases / en / 0 | ||||||||||||||
Finding a Path in Group-Labeled Graphs with Two Labels Forbidden | |||||||||||||||
description / en | description / en | ||||||||||||||
scientific article | scientific article; zbMATH DE number 6498692 | ||||||||||||||
Property / title | |||||||||||||||
Finding a Path in Group-Labeled Graphs with Two Labels Forbidden (English) | |||||||||||||||
Property / title: Finding a Path in Group-Labeled Graphs with Two Labels Forbidden (English) / rank | |||||||||||||||
Normal rank | |||||||||||||||
Property / zbMATH Open document ID | |||||||||||||||
Property / zbMATH Open document ID: 1440.05176 / rank | |||||||||||||||
Normal rank | |||||||||||||||
Property / DOI | |||||||||||||||
Property / DOI: 10.1007/978-3-662-47672-7_65 / rank | |||||||||||||||
Normal rank | |||||||||||||||
Property / published in | |||||||||||||||
Property / published in: Automata, Languages, and Programming / rank | |||||||||||||||
Normal rank | |||||||||||||||
Property / publication date | |||||||||||||||
27 October 2015
| |||||||||||||||
Property / publication date: 27 October 2015 / rank | |||||||||||||||
Normal rank | |||||||||||||||
Property / zbMATH DE Number | |||||||||||||||
Property / zbMATH DE Number: 6498692 / rank | |||||||||||||||
Normal rank | |||||||||||||||
Property / OpenAlex ID | |||||||||||||||
Property / OpenAlex ID: W1430606395 / rank | |||||||||||||||
Normal rank | |||||||||||||||
Property / arXiv ID | |||||||||||||||
Property / arXiv ID: 1807.00109 / rank | |||||||||||||||
Normal rank | |||||||||||||||
Property / cites work | |||||||||||||||
Property / cites work: Modularity of cycles and paths in graphs / rank | |||||||||||||||
Normal rank | |||||||||||||||
Property / cites work | |||||||||||||||
Property / cites work: Packing non-zero \(A\)-paths in group-labelled graphs / rank | |||||||||||||||
Normal rank | |||||||||||||||
Property / cites work | |||||||||||||||
Property / cites work: An algorithm for packing non-zero \(A\)-paths in group-labelled graphs / rank | |||||||||||||||
Normal rank | |||||||||||||||
Property / cites work | |||||||||||||||
Property / cites work: Q3577833 / rank | |||||||||||||||
Normal rank | |||||||||||||||
Property / cites work | |||||||||||||||
Property / cites work: The directed subgraph homeomorphism problem / rank | |||||||||||||||
Normal rank | |||||||||||||||
Property / cites work | |||||||||||||||
Property / cites work: Efficient Planarity Testing / rank | |||||||||||||||
Normal rank | |||||||||||||||
Property / cites work | |||||||||||||||
Property / cites work: Non-zero disjoint cycles in highly connected group labelled graphs / rank | |||||||||||||||
Normal rank | |||||||||||||||
Property / cites work | |||||||||||||||
Property / cites work: Finding a path with two labels forbidden in group-labeled graphs / rank | |||||||||||||||
Normal rank | |||||||||||||||
Property / cites work | |||||||||||||||
Property / cites work: The even-path problem for graphs and digraphs / rank | |||||||||||||||
Normal rank | |||||||||||||||
Property / cites work | |||||||||||||||
Property / cites work: Pólya's permanent problem / rank | |||||||||||||||
Normal rank | |||||||||||||||
Property / cites work | |||||||||||||||
Property / cites work: Permanents, Pfaffian orientations, and even directed circuits / rank | |||||||||||||||
Normal rank | |||||||||||||||
Property / cites work | |||||||||||||||
Property / cites work: A Polynomial Solution to the Undirected Two Paths Problem / rank | |||||||||||||||
Normal rank | |||||||||||||||
Property / cites work | |||||||||||||||
Property / cites work: Disjoint paths in graphs / rank | |||||||||||||||
Normal rank | |||||||||||||||
Property / cites work | |||||||||||||||
Property / cites work: 2-linked graphs / rank | |||||||||||||||
Normal rank | |||||||||||||||
Property / cites work | |||||||||||||||
Property / cites work: Packing non-zero \(A\)-paths via matroid matching / rank | |||||||||||||||
Normal rank | |||||||||||||||
Property / cites work | |||||||||||||||
Property / cites work: Packing cycles with modularity constraints / rank | |||||||||||||||
Normal rank | |||||||||||||||
Property / cites work | |||||||||||||||
Property / cites work: Packing <i>A</i>-paths in Group-Labelled Graphs via Linear Matroid Parity / rank | |||||||||||||||
Normal rank | |||||||||||||||
Property / cites work | |||||||||||||||
Property / cites work: Graph Theory / rank | |||||||||||||||
Normal rank | |||||||||||||||
Property / cites work | |||||||||||||||
Property / cites work: A unified Erdős-Pósa theorem for constrained cycles / rank | |||||||||||||||
Normal rank | |||||||||||||||
Property / cites work | |||||||||||||||
Property / cites work: Graph minors. XIII: The disjoint paths problem / rank | |||||||||||||||
Normal rank | |||||||||||||||
Property / cites work | |||||||||||||||
Property / cites work: Packing $A$-Paths in Group-Labelled Graphs via Linear Matroid Parity / rank | |||||||||||||||
Normal rank |
Latest revision as of 11:13, 22 July 2024
scientific article; zbMATH DE number 6498692
- Finding a Path in Group-Labeled Graphs with Two Labels Forbidden
Language | Label | Description | Also known as |
---|---|---|---|
English | Finding a path with two labels forbidden in group-labeled graphs |
scientific article; zbMATH DE number 6498692 |
|
Statements
Finding a path with two labels forbidden in group-labeled graphs (English)
0 references
Finding a Path in Group-Labeled Graphs with Two Labels Forbidden (English)
0 references
22 April 2020
0 references
27 October 2015
0 references
group-labeled graph
0 references
non-zero path
0 references
\(s-t\) path
0 references
2-disjoint paths
0 references