Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

Cyclic Matching Sequencibility of Graphs

From MaRDI portal
Publication:2906863
Jump to:navigation, search

zbMath1256.05195arXiv1109.6521MaRDI QIDQ2906863

Seth A. Meyer, Richard A. Brualdi, Kathleen P. Kiernan, Michael William Schroeder

Publication date: 5 September 2012

Full work available at URL: https://arxiv.org/abs/1109.6521


zbMATH Keywords

matching numbermatching sequencibilitycyclic ordering of edges


Mathematics Subject Classification ID

Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)


Related Items (6)

The cyclic matching sequenceability of regular graphs ⋮ The \(r\)-matching sequencibility of complete graphs ⋮ Permutations that separate close elements ⋮ Combinatorial properties of integer matrices and integer matrices modk ⋮ Unnamed Item ⋮ The $r$-matching sequencibility of complete multi-$k$-partite $k$-graphs




This page was built for publication: Cyclic Matching Sequencibility of Graphs

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:2906863&oldid=15872318"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 3 February 2024, at 20:11.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki