Suche senden
Hochladen
BGW2012 - Linear balanceable and subcubic balanceable graphs
âą
1 gefÀllt mir
âą
334 views
T
ttrunck
Folgen
Technologie
Melden
Teilen
Melden
Teilen
1 von 25
Jetzt herunterladen
Downloaden Sie, um offline zu lesen
Empfohlen
Csr2011 june16 12_00_wagner
Csr2011 june16 12_00_wagner
CSR2011
Â
A lattice-based consensus clustering
A lattice-based consensus clustering
Dmitrii Ignatov
Â
Computational Information Geometry: A quick review (ICMS)
Computational Information Geometry: A quick review (ICMS)
Frank Nielsen
Â
1452 86301000013 m
1452 86301000013 m
Praveen Kumar
Â
On Convolution of Graph Signals and Deep Learning on Graph Domains
On Convolution of Graph Signals and Deep Learning on Graph Domains
Jean-Charles Vialatte
Â
Slides: Total Jensen divergences: Definition, Properties and k-Means++ Cluste...
Slides: Total Jensen divergences: Definition, Properties and k-Means++ Cluste...
Frank Nielsen
Â
SUPER MAGIC CORONATIONS OF GRAPHS
SUPER MAGIC CORONATIONS OF GRAPHS
IAEME Publication
Â
Clustering in Hilbert geometry for machine learning
Clustering in Hilbert geometry for machine learning
Frank Nielsen
Â
Empfohlen
Csr2011 june16 12_00_wagner
Csr2011 june16 12_00_wagner
CSR2011
Â
A lattice-based consensus clustering
A lattice-based consensus clustering
Dmitrii Ignatov
Â
Computational Information Geometry: A quick review (ICMS)
Computational Information Geometry: A quick review (ICMS)
Frank Nielsen
Â
1452 86301000013 m
1452 86301000013 m
Praveen Kumar
Â
On Convolution of Graph Signals and Deep Learning on Graph Domains
On Convolution of Graph Signals and Deep Learning on Graph Domains
Jean-Charles Vialatte
Â
Slides: Total Jensen divergences: Definition, Properties and k-Means++ Cluste...
Slides: Total Jensen divergences: Definition, Properties and k-Means++ Cluste...
Frank Nielsen
Â
SUPER MAGIC CORONATIONS OF GRAPHS
SUPER MAGIC CORONATIONS OF GRAPHS
IAEME Publication
Â
Clustering in Hilbert geometry for machine learning
Clustering in Hilbert geometry for machine learning
Frank Nielsen
Â
Clustering in Hilbert simplex geometry
Clustering in Hilbert simplex geometry
Frank Nielsen
Â
Divergence center-based clustering and their applications
Divergence center-based clustering and their applications
Frank Nielsen
Â
Divergence clustering
Divergence clustering
Frank Nielsen
Â
A Note on Non Split Locating Equitable Domination
A Note on Non Split Locating Equitable Domination
ijdmtaiir
Â
International journal of applied sciences and innovation vol 2015 - no 2 - ...
International journal of applied sciences and innovation vol 2015 - no 2 - ...
sophiabelthome
Â
Analytic construction of points on modular elliptic curves
Analytic construction of points on modular elliptic curves
mmasdeu
Â
Patch Matching with Polynomial Exponential Families and Projective Divergences
Patch Matching with Polynomial Exponential Families and Projective Divergences
Frank Nielsen
Â
Wythoff construction and l1-embedding
Wythoff construction and l1-embedding
Mathieu Dutour Sikiric
Â
L(2,1)-labeling
L(2,1)-labeling
Maria Jomelyn Ylen
Â
FURTHER RESULTS ON ODD HARMONIOUS GRAPHS
FURTHER RESULTS ON ODD HARMONIOUS GRAPHS
graphhoc
Â
445 colouring0
445 colouring0
Praveen Kumar
Â
X4102188192
X4102188192
IJERA Editor
Â
Some New Families on H-Cordial Graphs
Some New Families on H-Cordial Graphs
IJMER
Â
Even Harmonious Labeling of the Graph H (2n, 2t+1)
Even Harmonious Labeling of the Graph H (2n, 2t+1)
inventionjournals
Â
Classification with mixtures of curved Mahalanobis metrics
Classification with mixtures of curved Mahalanobis metrics
Frank Nielsen
Â
Introduction to harmonic analysis on groups, links with spatial correlation.
Introduction to harmonic analysis on groups, links with spatial correlation.
Valentin De Bortoli
Â
The dual geometry of Shannon information
The dual geometry of Shannon information
Frank Nielsen
Â
Applications and Properties of Unique Coloring of Graphs
Applications and Properties of Unique Coloring of Graphs
IJERA Editor
Â
4. [22 25]characterization of connected vertex magic total labeling graphs in...
4. [22 25]characterization of connected vertex magic total labeling graphs in...
Alexander Decker
Â
Paper id 71201961
Paper id 71201961
IJRAT
Â
V1_I2_2012_Paper1.doc
V1_I2_2012_Paper1.doc
praveena06
Â
10.1.1.92.3502
10.1.1.92.3502
wildanowitzki
Â
Weitere Àhnliche Inhalte
Was ist angesagt?
Clustering in Hilbert simplex geometry
Clustering in Hilbert simplex geometry
Frank Nielsen
Â
Divergence center-based clustering and their applications
Divergence center-based clustering and their applications
Frank Nielsen
Â
Divergence clustering
Divergence clustering
Frank Nielsen
Â
A Note on Non Split Locating Equitable Domination
A Note on Non Split Locating Equitable Domination
ijdmtaiir
Â
International journal of applied sciences and innovation vol 2015 - no 2 - ...
International journal of applied sciences and innovation vol 2015 - no 2 - ...
sophiabelthome
Â
Analytic construction of points on modular elliptic curves
Analytic construction of points on modular elliptic curves
mmasdeu
Â
Patch Matching with Polynomial Exponential Families and Projective Divergences
Patch Matching with Polynomial Exponential Families and Projective Divergences
Frank Nielsen
Â
Wythoff construction and l1-embedding
Wythoff construction and l1-embedding
Mathieu Dutour Sikiric
Â
L(2,1)-labeling
L(2,1)-labeling
Maria Jomelyn Ylen
Â
FURTHER RESULTS ON ODD HARMONIOUS GRAPHS
FURTHER RESULTS ON ODD HARMONIOUS GRAPHS
graphhoc
Â
445 colouring0
445 colouring0
Praveen Kumar
Â
X4102188192
X4102188192
IJERA Editor
Â
Some New Families on H-Cordial Graphs
Some New Families on H-Cordial Graphs
IJMER
Â
Even Harmonious Labeling of the Graph H (2n, 2t+1)
Even Harmonious Labeling of the Graph H (2n, 2t+1)
inventionjournals
Â
Classification with mixtures of curved Mahalanobis metrics
Classification with mixtures of curved Mahalanobis metrics
Frank Nielsen
Â
Introduction to harmonic analysis on groups, links with spatial correlation.
Introduction to harmonic analysis on groups, links with spatial correlation.
Valentin De Bortoli
Â
The dual geometry of Shannon information
The dual geometry of Shannon information
Frank Nielsen
Â
Applications and Properties of Unique Coloring of Graphs
Applications and Properties of Unique Coloring of Graphs
IJERA Editor
Â
4. [22 25]characterization of connected vertex magic total labeling graphs in...
4. [22 25]characterization of connected vertex magic total labeling graphs in...
Alexander Decker
Â
Was ist angesagt?
(19)
Clustering in Hilbert simplex geometry
Clustering in Hilbert simplex geometry
Â
Divergence center-based clustering and their applications
Divergence center-based clustering and their applications
Â
Divergence clustering
Divergence clustering
Â
A Note on Non Split Locating Equitable Domination
A Note on Non Split Locating Equitable Domination
Â
International journal of applied sciences and innovation vol 2015 - no 2 - ...
International journal of applied sciences and innovation vol 2015 - no 2 - ...
Â
Analytic construction of points on modular elliptic curves
Analytic construction of points on modular elliptic curves
Â
Patch Matching with Polynomial Exponential Families and Projective Divergences
Patch Matching with Polynomial Exponential Families and Projective Divergences
Â
Wythoff construction and l1-embedding
Wythoff construction and l1-embedding
Â
L(2,1)-labeling
L(2,1)-labeling
Â
FURTHER RESULTS ON ODD HARMONIOUS GRAPHS
FURTHER RESULTS ON ODD HARMONIOUS GRAPHS
Â
445 colouring0
445 colouring0
Â
X4102188192
X4102188192
Â
Some New Families on H-Cordial Graphs
Some New Families on H-Cordial Graphs
Â
Even Harmonious Labeling of the Graph H (2n, 2t+1)
Even Harmonious Labeling of the Graph H (2n, 2t+1)
Â
Classification with mixtures of curved Mahalanobis metrics
Classification with mixtures of curved Mahalanobis metrics
Â
Introduction to harmonic analysis on groups, links with spatial correlation.
Introduction to harmonic analysis on groups, links with spatial correlation.
Â
The dual geometry of Shannon information
The dual geometry of Shannon information
Â
Applications and Properties of Unique Coloring of Graphs
Applications and Properties of Unique Coloring of Graphs
Â
4. [22 25]characterization of connected vertex magic total labeling graphs in...
4. [22 25]characterization of connected vertex magic total labeling graphs in...
Â
Ăhnlich wie BGW2012 - Linear balanceable and subcubic balanceable graphs
Paper id 71201961
Paper id 71201961
IJRAT
Â
V1_I2_2012_Paper1.doc
V1_I2_2012_Paper1.doc
praveena06
Â
10.1.1.92.3502
10.1.1.92.3502
wildanowitzki
Â
graphs
graphs
machrist
Â
Doubled Geometry and Double Field Theory
Doubled Geometry and Double Field Theory
Luigi
Â
New Classes of Odd Graceful Graphs - M. E. Abdel-Aal
New Classes of Odd Graceful Graphs - M. E. Abdel-Aal
GiselleginaGloria
Â
New Classes of Odd Graceful Graphs
New Classes of Odd Graceful Graphs
graphhoc
Â
Internal workshop jub talk jan 2013
Internal workshop jub talk jan 2013
Jurgen Riedel
Â
IJCER (www.ijceronline.com) International Journal of computational Engineerin...
IJCER (www.ijceronline.com) International Journal of computational Engineerin...
ijceronline
Â
Berezin-Toeplitz Quantization On Coadjoint orbits
Berezin-Toeplitz Quantization On Coadjoint orbits
Hassan Jolany
Â
Total Dominating Color Transversal Number of Graphs And Graph Operations
Total Dominating Color Transversal Number of Graphs And Graph Operations
inventionjournals
Â
The Total Strong Split Domination Number of Graphs
The Total Strong Split Domination Number of Graphs
inventionjournals
Â
1. Graph and Graph Terminologiesimp.pptx
1. Graph and Graph Terminologiesimp.pptx
swapnilbs2728
Â
Pullbacks and Pushouts in the Category of Graphs
Pullbacks and Pushouts in the Category of Graphs
iosrjce
Â
ICAMS033-G.NITHYA.pptx
ICAMS033-G.NITHYA.pptx
mathematicssac
Â
Seminar Sample
Seminar Sample
Spencer Leonardis
Â
Discrete-Chapter 11 Graphs Part II
Discrete-Chapter 11 Graphs Part II
Wongyos Keardsri
Â
FDP-libre(1)
FDP-libre(1)
NARAYANASWAMY CHANDRAMOWLISWARAN
Â
Ce31342345
Ce31342345
IJMER
Â
Am03102420247
Am03102420247
ijceronline
Â
Ăhnlich wie BGW2012 - Linear balanceable and subcubic balanceable graphs
(20)
Paper id 71201961
Paper id 71201961
Â
V1_I2_2012_Paper1.doc
V1_I2_2012_Paper1.doc
Â
10.1.1.92.3502
10.1.1.92.3502
Â
graphs
graphs
Â
Doubled Geometry and Double Field Theory
Doubled Geometry and Double Field Theory
Â
New Classes of Odd Graceful Graphs - M. E. Abdel-Aal
New Classes of Odd Graceful Graphs - M. E. Abdel-Aal
Â
New Classes of Odd Graceful Graphs
New Classes of Odd Graceful Graphs
Â
Internal workshop jub talk jan 2013
Internal workshop jub talk jan 2013
Â
IJCER (www.ijceronline.com) International Journal of computational Engineerin...
IJCER (www.ijceronline.com) International Journal of computational Engineerin...
Â
Berezin-Toeplitz Quantization On Coadjoint orbits
Berezin-Toeplitz Quantization On Coadjoint orbits
Â
Total Dominating Color Transversal Number of Graphs And Graph Operations
Total Dominating Color Transversal Number of Graphs And Graph Operations
Â
The Total Strong Split Domination Number of Graphs
The Total Strong Split Domination Number of Graphs
Â
1. Graph and Graph Terminologiesimp.pptx
1. Graph and Graph Terminologiesimp.pptx
Â
Pullbacks and Pushouts in the Category of Graphs
Pullbacks and Pushouts in the Category of Graphs
Â
ICAMS033-G.NITHYA.pptx
ICAMS033-G.NITHYA.pptx
Â
Seminar Sample
Seminar Sample
Â
Discrete-Chapter 11 Graphs Part II
Discrete-Chapter 11 Graphs Part II
Â
FDP-libre(1)
FDP-libre(1)
Â
Ce31342345
Ce31342345
Â
Am03102420247
Am03102420247
Â
KĂŒrzlich hochgeladen
The Role of Taxonomy and Ontology in Semantic Layers - Heather Hedden.pdf
The Role of Taxonomy and Ontology in Semantic Layers - Heather Hedden.pdf
Enterprise Knowledge
Â
Boost PC performance: How more available memory can improve productivity
Boost PC performance: How more available memory can improve productivity
Principled Technologies
Â
Handwritten Text Recognition for manuscripts and early printed texts
Handwritten Text Recognition for manuscripts and early printed texts
Maria Levchenko
Â
Strategies for Unlocking Knowledge Management in Microsoft 365 in the Copilot...
Strategies for Unlocking Knowledge Management in Microsoft 365 in the Copilot...
Drew Madelung
Â
Breaking the Kubernetes Kill Chain: Host Path Mount
Breaking the Kubernetes Kill Chain: Host Path Mount
Puma Security, LLC
Â
The 7 Things I Know About Cyber Security After 25 Years | April 2024
The 7 Things I Know About Cyber Security After 25 Years | April 2024
Rafal Los
Â
Scaling API-first â The story of a global engineering organization
Scaling API-first â The story of a global engineering organization
Radu Cotescu
Â
GenCyber Cyber Security Day Presentation
GenCyber Cyber Security Day Presentation
Michael W. Hawkins
Â
Kalyanpur ) Call Girls in Lucknow Finest Escorts Service đž 8923113531 đ° Avail...
Kalyanpur ) Call Girls in Lucknow Finest Escorts Service đž 8923113531 đ° Avail...
gurkirankumar98700
Â
Enhancing Worker Digital Experience: A Hands-on Workshop for Partners
Enhancing Worker Digital Experience: A Hands-on Workshop for Partners
ThousandEyes
Â
FULL ENJOY đ 8264348440 đ Call Girls in Diplomatic Enclave | Delhi
FULL ENJOY đ 8264348440 đ Call Girls in Diplomatic Enclave | Delhi
soniya singh
Â
SQL Database Design For Developers at php[tek] 2024
SQL Database Design For Developers at php[tek] 2024
Scott Keck-Warren
Â
Unblocking The Main Thread Solving ANRs and Frozen Frames
Unblocking The Main Thread Solving ANRs and Frozen Frames
Sinan KOZAK
Â
The Codex of Business Writing Software for Real-World Solutions 2.pptx
The Codex of Business Writing Software for Real-World Solutions 2.pptx
Malak Abu Hammad
Â
Histor y of HAM Radio presentation slide
Histor y of HAM Radio presentation slide
vu2urc
Â
Mastering MySQL Database Architecture: Deep Dive into MySQL Shell and MySQL R...
Mastering MySQL Database Architecture: Deep Dive into MySQL Shell and MySQL R...
Miguel AraĂșjo
Â
Tech-Forward - Achieving Business Readiness For Copilot in Microsoft 365
Tech-Forward - Achieving Business Readiness For Copilot in Microsoft 365
2toLead Limited
Â
08448380779 Call Girls In Civil Lines Women Seeking Men
08448380779 Call Girls In Civil Lines Women Seeking Men
Delhi Call girls
Â
08448380779 Call Girls In Greater Kailash - I Women Seeking Men
08448380779 Call Girls In Greater Kailash - I Women Seeking Men
Delhi Call girls
Â
Slack Application Development 101 Slides
Slack Application Development 101 Slides
praypatel2
Â
KĂŒrzlich hochgeladen
(20)
The Role of Taxonomy and Ontology in Semantic Layers - Heather Hedden.pdf
The Role of Taxonomy and Ontology in Semantic Layers - Heather Hedden.pdf
Â
Boost PC performance: How more available memory can improve productivity
Boost PC performance: How more available memory can improve productivity
Â
Handwritten Text Recognition for manuscripts and early printed texts
Handwritten Text Recognition for manuscripts and early printed texts
Â
Strategies for Unlocking Knowledge Management in Microsoft 365 in the Copilot...
Strategies for Unlocking Knowledge Management in Microsoft 365 in the Copilot...
Â
Breaking the Kubernetes Kill Chain: Host Path Mount
Breaking the Kubernetes Kill Chain: Host Path Mount
Â
The 7 Things I Know About Cyber Security After 25 Years | April 2024
The 7 Things I Know About Cyber Security After 25 Years | April 2024
Â
Scaling API-first â The story of a global engineering organization
Scaling API-first â The story of a global engineering organization
Â
GenCyber Cyber Security Day Presentation
GenCyber Cyber Security Day Presentation
Â
Kalyanpur ) Call Girls in Lucknow Finest Escorts Service đž 8923113531 đ° Avail...
Kalyanpur ) Call Girls in Lucknow Finest Escorts Service đž 8923113531 đ° Avail...
Â
Enhancing Worker Digital Experience: A Hands-on Workshop for Partners
Enhancing Worker Digital Experience: A Hands-on Workshop for Partners
Â
FULL ENJOY đ 8264348440 đ Call Girls in Diplomatic Enclave | Delhi
FULL ENJOY đ 8264348440 đ Call Girls in Diplomatic Enclave | Delhi
Â
SQL Database Design For Developers at php[tek] 2024
SQL Database Design For Developers at php[tek] 2024
Â
Unblocking The Main Thread Solving ANRs and Frozen Frames
Unblocking The Main Thread Solving ANRs and Frozen Frames
Â
The Codex of Business Writing Software for Real-World Solutions 2.pptx
The Codex of Business Writing Software for Real-World Solutions 2.pptx
Â
Histor y of HAM Radio presentation slide
Histor y of HAM Radio presentation slide
Â
Mastering MySQL Database Architecture: Deep Dive into MySQL Shell and MySQL R...
Mastering MySQL Database Architecture: Deep Dive into MySQL Shell and MySQL R...
Â
Tech-Forward - Achieving Business Readiness For Copilot in Microsoft 365
Tech-Forward - Achieving Business Readiness For Copilot in Microsoft 365
Â
08448380779 Call Girls In Civil Lines Women Seeking Men
08448380779 Call Girls In Civil Lines Women Seeking Men
Â
08448380779 Call Girls In Greater Kailash - I Women Seeking Men
08448380779 Call Girls In Greater Kailash - I Women Seeking Men
Â
Slack Application Development 101 Slides
Slack Application Development 101 Slides
Â
BGW2012 - Linear balanceable and subcubic balanceable graphs
1.
Linear balanceable and
subcubic balanceable graphs Théophile Trunck BGW 2012 November 2012 Théophile Trunck (BGW 2012) Balanceable graphs November 2012 1 / 23
2.
Co-authors Joint work with:
Pierre Aboulker, LIAFA, Paris Marko RadovanoviÄ, Union University, Belgrade Nicolas Trotignon, CNRS, LIP, Lyon Kristina VuĆĄkoviÄ, Union University, Belgrade and Leeds University ThĂ©ophile Trunck (BGW 2012) Balanceable graphs November 2012 2 / 23
3.
Motivation Conjecture (Morris, Spiga
and Webb) If G is cubic and every induced cycle has length divisible by 4, then G has a pair of twins. Théophile Trunck (BGW 2012) Balanceable graphs November 2012 3 / 23
4.
Motivation Conjecture (Morris, Spiga
and Webb) If G is cubic and every induced cycle has length divisible by 4, then G has a pair of twins. Théophile Trunck (BGW 2012) Balanceable graphs November 2012 3 / 23
5.
DeïŹnitions DeïŹnition Let G be
a bipartite graph, we say that G is balanceable if we can give weights +1, â1 to edges such that the weight of every induced cycle is divisible by 4. ThĂ©ophile Trunck (BGW 2012) Balanceable graphs November 2012 4 / 23
6.
Characterization Theorem (Truemper) A bipartite
graph is balanceable if and only if it does not contain an odd wheel nor an odd 3-path conïŹguration. ThĂ©ophile Trunck (BGW 2012) Balanceable graphs November 2012 5 / 23
7.
Conjecture Conjecture (Conforti, Cornuéjols
and VuĆĄkoviÄ) In a balanceable bipartite graph either every edge belongs to some R10 or there is an edge that is not the unique chord of a cycle. ThĂ©ophile Trunck (BGW 2012) Balanceable graphs November 2012 6 / 23
8.
Main results Theorem If G
is a 4-hole free balanceable graph on at least two vertices, then G contains at least two vertices of degree at most 2. Theorem If G is a cubic balanceable graph that is not R10 , then G has a pair of twins none of whose neighbors is a cut vertex of G . Corollary The conjecture is true if G does not contain a 4-hole or if â(G ) †3. ThĂ©ophile Trunck (BGW 2012) Balanceable graphs November 2012 7 / 23
9.
Decomposition Theorem (Conforti, Cornuéjols,
Kappor and VuĆĄkoviÄ + Conforti and Rao + Yannakakis + easy lemma) Let G be a connected balanceable graph. If G is 4-hole free, then G is basic, or has a 2-join, a 6-join or a star cutset. If â(G ) †3, then G is basic or is R10 , or has a 2-join, a 6-join or a star cutset. ThĂ©ophile Trunck (BGW 2012) Balanceable graphs November 2012 8 / 23
10.
The Good
B1 B2 B2 C1 C2 C2 A1 A2 A2 X1 X2 X2 Figure : 2-join Théophile Trunck (BGW 2012) Balanceable graphs November 2012 9 / 23
11.
The Bad
B1 B2 B2 C1 C2 C2 A1 A2 A2 X1 X2 X2 Figure : 6-join Théophile Trunck (BGW 2012) Balanceable graphs November 2012 10 / 23
12.
The Ugly DeïŹnition A star
cutset in a graph G is a set S of vertices such that: G S is disconnected. S contains a vertex v adjacent to all other vertices of S. We note (x, R) the star cutset. Théophile Trunck (BGW 2012) Balanceable graphs November 2012 11 / 23
13.
In a perfect
world Theorem Let G be bipartite 4-hole free with no-star cutset, then {2, 6}-join blocks preserve: Being balanceable; Having no star cutset; Having no 6-join. Théophile Trunck (BGW 2012) Balanceable graphs November 2012 12 / 23
14.
In a perfect
world Theorem Let G be bipartite 4-hole free with no-star cutset, then {2, 6}-join blocks preserve: Being balanceable; Having no star cutset; Having no 6-join. Theorem Let G be a bipartite 4-hole free graph. Let X1 , X2 be a minimally-sided {2, 6}-join. If G has no star cutset, then the block of decomposition G1 has no {2, 6}-join. Théophile Trunck (BGW 2012) Balanceable graphs November 2012 12 / 23
15.
Crossing 2-join Théophile
Trunck (BGW 2012) Balanceable graphs November 2012 13 / 23
16.
Star cutset, again DeïŹnition A
star cutset in a graph G is a set S of vertices such that: G S is disconnected. S contains a vertex v adjacent to all other vertices of S. DeïŹnition A double star cutset in a graph G is a set S of vertices such that: G S has two disconnected components C1 and C2 . S contains an edge uv such that every vertex in S is adjacent to u or v . We call C1 âȘ S and C2 âȘ S the blocks of decomposition, and we note (u, v , U, V ) where U â N(u) and V â N(v ) the double star cutset. ThĂ©ophile Trunck (BGW 2012) Balanceable graphs November 2012 14 / 23
17.
Extreme double star
cutset Theorem Let G be a 2-connected 4-hole free bipartite graph that has a star cutset. Let G1 be a minimal side of a minimally-sided double star cutset of G . Then G1 does not have a star cutset. Théophile Trunck (BGW 2012) Balanceable graphs November 2012 15 / 23
18.
Extreme double star
cutset u v G1 is 2-connected. U V Théophile Trunck (BGW 2012) Balanceable graphs November 2012 16 / 23
19.
Extreme double star
cutset G1 is 2-connected. (x, R) a star cutset in G1 . x u v |R â© S| †1. If R â© {u, v } = â then U V (x, y â R, R {y }, â ) is a double star cutset in G . ThĂ©ophile Trunck (BGW 2012) Balanceable graphs November 2012 17 / 23
20.
Extreme double star
cutset G1 is 2-connected. C component in G1 ({x} âȘ R) x u v with C â© ({v } âȘ V ) = â . C U =â U V (x, u, R {u}, U) is a double star cutset in G . ThĂ©ophile Trunck (BGW 2012) Balanceable graphs November 2012 18 / 23
21.
Extreme double star
cutset If a component of G1 ({x} âȘ R) x=u v contains a vertex from U or V , it contains vertex from G1 S. U V (x, v , U âȘ R {v }, V ) is a double star cutset in G . ThĂ©ophile Trunck (BGW 2012) Balanceable graphs November 2012 19 / 23
22.
Extreme double star
cutset {v } âȘ V are in the same component in G1 ({x} âȘ R) u v If a component of G1 ({x} âȘ R) contains a vertex from U, it contains vertex from G1 S. xâU V (x, u, R {u}, U {x}) is a double star cutset in G . ThĂ©ophile Trunck (BGW 2012) Balanceable graphs November 2012 20 / 23
23.
Sketch of the
proof Theorem If G is a 4-hole free balanceable graph on at least two vertices, then G contains at least two vertices of degree at most 2. Proof. If we have a cut vertex it is easy. Assume there is a star cutset. Take a double star cutset such that the block G has no star cutset. G is basic or has {2, 6}-join. If G is basic ïŹnd two vertices of degree 2. Take (X1 , X2 ) a minimally-sided {2, 6}-join with small intersection with the double star cutset. Now G1 is basic, ïŹnd good vertices in it. ThĂ©ophile Trunck (BGW 2012) Balanceable graphs November 2012 21 / 23
24.
Open questions Question How to
build every cubic graph such that every induced cycle has length divisible by 4 ? Conjecture (Conforti, CornuĂ©jols and VuĆĄkoviÄ) In a balanceable bipartite graph either every edge belongs to some R10 or there is an edge that is not the unique chord of a cycle. ThĂ©ophile Trunck (BGW 2012) Balanceable graphs November 2012 22 / 23
25.
Thanks for you
attention. Théophile Trunck (BGW 2012) Balanceable graphs November 2012 23 / 23
Jetzt herunterladen