Matches in Ghent University Academic Bibliography for { <https://biblio.ugent.be/publication/01HS8PWYK8PFRFEGXXC2MJJJ1V> ?p ?o. }
Showing items 1 to 25 of
25
with 100 items per page.
- 01HS8PWYK8PFRFEGXXC2MJJJ1V classification P1.
- 01HS8PWYK8PFRFEGXXC2MJJJ1V date "2023".
- 01HS8PWYK8PFRFEGXXC2MJJJ1V language "eng".
- 01HS8PWYK8PFRFEGXXC2MJJJ1V type conference.
- 01HS8PWYK8PFRFEGXXC2MJJJ1V hasPart 01HS8Q1VQ9VBH5FSTH5RN4NB13.pdf.
- 01HS8PWYK8PFRFEGXXC2MJJJ1V subject "Mathematics and Statistics".
- 01HS8PWYK8PFRFEGXXC2MJJJ1V doi "10.1007/978-3-031-43380-1_26".
- 01HS8PWYK8PFRFEGXXC2MJJJ1V isbn "9783031433795".
- 01HS8PWYK8PFRFEGXXC2MJJJ1V isbn "9783031433801".
- 01HS8PWYK8PFRFEGXXC2MJJJ1V issn "0302-9743".
- 01HS8PWYK8PFRFEGXXC2MJJJ1V issn "1611-3349".
- 01HS8PWYK8PFRFEGXXC2MJJJ1V presentedAt urn:uuid:c508769b-5cc2-40ed-80cc-e4933c635858.
- 01HS8PWYK8PFRFEGXXC2MJJJ1V volume "14093".
- 01HS8PWYK8PFRFEGXXC2MJJJ1V abstract "An edge e of a graph G is called deletable for some orientation o if the restriction of o to G - e is a strong orientation. In 2021, Horsch and Szigeti proposed a new parameter for 3-edge-connected graphs, called the Frank number, which refines k-edge-connectivity. The Frank number is defined as the minimum number of orientations of G for which every edge of G is deletable in at least one of them. They showed that every 3-edge-connected graph has Frank number at most 7 and that in case these graphs are also 3-edge-colourable graphs the parameter is at most 3. Here we strengthen the latter result by showing that such graphs have Frank number 2, which also confirms a conjecture by Bar ' at and Bl ' azsik. Furthermore, we prove two sufficient conditions for cubic graphs to have Frank number 2 and use them in an algorithm to computationally show that the Petersen graph is the only cyclically 4-edge-connected cubic graph up to 36 vertices having Frank number greater than 2.".
- 01HS8PWYK8PFRFEGXXC2MJJJ1V author 0EE07BBE-F0EE-11E1-A9DE-61C894A0A6B4.
- 01HS8PWYK8PFRFEGXXC2MJJJ1V author urn:uuid:36c3f990-5e3a-4862-bfc1-968c41fbf271.
- 01HS8PWYK8PFRFEGXXC2MJJJ1V author urn:uuid:e0a8e71a-113b-46d7-8ce1-ca23509b5ba6.
- 01HS8PWYK8PFRFEGXXC2MJJJ1V dateCreated "2024-03-18T11:59:38Z".
- 01HS8PWYK8PFRFEGXXC2MJJJ1V dateModified "2024-07-09T15:34:09Z".
- 01HS8PWYK8PFRFEGXXC2MJJJ1V name "On the Frank number and nowhere-zero flows on graphs".
- 01HS8PWYK8PFRFEGXXC2MJJJ1V pagination urn:uuid:c6fc7fa7-f217-4f2d-8b62-7713e520cdac.
- 01HS8PWYK8PFRFEGXXC2MJJJ1V publisher urn:uuid:16e825e1-f1da-4743-b267-22667c0dd815.
- 01HS8PWYK8PFRFEGXXC2MJJJ1V sameAs LU-01HS8PWYK8PFRFEGXXC2MJJJ1V.
- 01HS8PWYK8PFRFEGXXC2MJJJ1V sourceOrganization urn:uuid:37ed3020-83f2-4c38-8ca6-f281bf0ba1a6.
- 01HS8PWYK8PFRFEGXXC2MJJJ1V type P1.