Compatible spanning circuits and forbidden induced subgraphs
DOI10.1007/S00373-023-02735-8OpenAlexW4391033100MaRDI QIDQ6184989FDOQ6184989
Authors: Zhiwei Guo, Christoph Brause, Maximilian Geißer, Ingo Schiermeyer 
Publication date: 29 January 2024
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00373-023-02735-8
Recommendations
- Compatible spanning circuits in edge-colored graphs
- Almost Eulerian compatible spanning circuits in edge-colored graphs
- Some algorithmic results for finding compatible spanning circuits in edge-colored graphs
- Eulerian Circuits with No Monochromatic Transitions in Edge-colored Digraphs
- Sufficient conditions for the existence of spanning colored trees in edge-colored graphs
Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Extremal problems in graph theory (05C35) Eulerian and Hamiltonian graphs (05C45) Coloring of graphs and hypergraphs (05C15) Paths and cycles (05C38)
Cites Work
- Graph theory
- On a closure concept in claw-free graphs
- A reduction method to find spanning Eulerian subgraphs
- A note on Hamiltonian circuits
- A note on graphs spanned by Eulerian graphs
- Hamiltonian results inK1,3-free graphs
- Supereulerian graphs: A survey
- Sufficient conditions for a digraph to be supereulerian
- Title not available (Why is that?)
- Hamilton cycles in 5-connected line graphs
- A Note on Sub-Eulerian Graphs
- Hamiltonian problems in edge-colored complete graphs and eulerian cycles in edge-colored graphs : some complexity results
- Title not available (Why is that?)
- Hamiltonicity and minimum degree in 3-connected claw-free graphs
- Forbidden triples for Hamiltonicity
- Hamilton cycles in claw-free graphs
- The Chvàtal-Erdős condition for supereulerian graphs and the Hamiltonian index
- Properly coloured Hamiltonian cycles in edge-coloured complete graphs
- Forbidden pairs for spanning (closed) trails
- The orderly colored longest path problem -- a survey of applications and new algorithms
- Title not available (Why is that?)
- Compatible spanning circuits in edge-colored graphs
- Title not available (Why is that?)
- Some algorithmic results for finding compatible spanning circuits in edge-colored graphs
- Compatible Eulerian circuits in Eulerian (di)graphs with generalized transition systems
- Hamiltonicity of digraphs for universal cycles of permutations
- Almost Eulerian compatible spanning circuits in edge-colored graphs
- Forbidden set of induced subgraphs for 2-connected supereulerian graphs
This page was built for publication: Compatible spanning circuits and forbidden induced subgraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6184989)
